#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,d[50005],viz[50005];
const int INF=1000000005;
vector < pair<int,int> > a[50005];
struct comp
{
    bool operator () (const int &a,const int &b)
    {
        return d[a]>d[b];
    }
};
priority_queue <int,vector<int>,comp> pq;
int main()
{
    int i,x,y,c,nod;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        a[x].push_back({y,c});
        a[y].push_back({x,c});
    }
    for(i=1;i<=n;i++)
    {
        d[i]=INF;
    }
    d[1]=0;
    pq.push(1);
    while(!pq.empty())
    {
        nod=pq.top();
        pq.pop();
        if(viz[nod]==1)
            continue;
        viz[nod]=1;
        for(i=0;i<a[nod].size();i++)
        {
            if(viz[a[nod][i].first]==0 && d[a[nod][i].first]>d[nod]+a[nod][i].second)
            {
                d[a[nod][i].first]=d[nod]+a[nod][i].second;
                pq.push(a[nod][i].first);
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==INF)
            g<<0<<" ";
        else
            g<<d[i]<<" ";
    }
    return 0;
}