#include <fstream>
#include <queue>
#include <vector>
#define INF 2000000000

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

struct elem
{
    int x,c;
    bool operator < (const elem &a) const
    {
        return c>a.c;
    }
};

int n,m;
vector <elem> a[50001];
priority_queue <elem> pq;
int dist[50001],vz[50001];

int main()
{
    int i,x,y,z;
    elem p;
    f>>n>>m;

    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        a[x].push_back({y,z});
        a[y].push_back({y,z});
    }

    for(i=2;i<=n;i++)dist[i]=INF;

    pq.push({1,0});
    while(!pq.empty())
    {
        p=pq.top();
        pq.pop();

        if(p.c == dist[p.x])
        {
            for(auto u:a[p.x])
                if(dist[u.x]>dist[p.x]+u.c)
                {
                    dist[u.x]=dist[p.x]+u.c;
                    pq.push({u.x,dist[u.x]});
                }
        }

    }
    for(i=2;i<=n;i++)
        if(dist[i]==INF)g<<0<<' ';
        else g<<dist[i]<<' ';
}