#include <fstream>
#define pinf 1<<30
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct nod
{
    int urm,cost,ant;
    nod *next;
};
nod *p,*l[50001];
int x,y,i,j,n,nods,coada[50001],d[50001],minn,poz,c,m,ok,st,w,z,pr,u;
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y>>c;
        p=new nod;
        p->next=l[x];
        p->urm=y;
        p->ant=x;
        p->cost=c;
        l[x]=p;
    }
    pr=1;u=1;
    coada[u]=1;

    st=poz;
    for(i=1;i<=n;++i)
        if(d[i]==0&&i!=1)
            d[i]=pinf;
    d[1]=0;
    while(pr<=u)
    {
        x=coada[pr];
        pr++;
        p=new nod;
        p=l[x];
        while(p)
        {

                if(d[x]+p->cost<d[p->urm])
                    {
                        d[p->urm]=d[x]+p->cost;
                        coada[++u]=p->urm;
                    }
            p=p->next;
        }
    }
    for(i=2;i<=n;++i)
        if(d[i]==pinf)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";

    return 0;
}