#include <fstream>
#include <stack>
#include <queue>
#include <vector>
#include <iterator>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
priority_queue< ii,vector<ii>,greater<ii> > Q;
int n,m,i,a,ok[50001],nod,dist,b,c,d[50001];
vector<pair<int,int> > G[50001];
ii per,pereche;
int nod2,dist2;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>a>>b>>c;
        G[a].push_back(ii(b,c));
    }
    for(i=1;i<=n;i++)
        d[i]=1000000005;
    Q.push(ii(0,1));
    d[1]=0;
    while(!Q.empty())
    {
        per=Q.top();
        Q.pop();
        nod=per.second;
        dist=per.first;
        //if(!ok[nod]&&dist==d[nod])
        if(!ok[nod])
        {
            ok[nod]++;
            for(vector<pair<int,int> >::iterator it=G[nod].begin();it!=G[nod].end();it++)
            {
                pereche=*it;
                nod2=pereche.first;
                dist2=pereche.second;
                if(d[nod2]>d[nod]+dist2)
                {
                    d[nod2]=d[nod]+dist2;
                    Q.push(ii(d[nod2],nod2));
                }
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]!=1000000005)
            g<<d[i]<<" ";
        else
            g<<"0 ";
    }
    g<<'\n';
    return 0;
}