#include <iostream>
#include <fstream>
using namespace std;
int n,m,i,d[50001],viz[50001],inf=200000,x,y,c;
struct nod{
int x,c;
nod *urm;}*v[50001],*p;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
void adaug(nod *&p,int x,int c)
{
    nod *q,*u;
    q=new nod;
    q->x=x;
    q->c=c;
    q->urm=NULL;
    if(p==NULL)
        p=q;
    else
    {
        u=p;
        while(u->urm!=NULL)
            u=u->urm;
        u->urm=q;
    }
}
void minim(int &k)
{
    int i,mini=inf;
    for(i=1;i<=n;i++)
        if(viz[i]==0&&d[i]<mini)
    {
        mini=d[i];
        k=i;
    }
}
void dijkstra(int x)
{
    int nr,k,i;
    nod *p;
    viz[x]=1;
    nr=1;
    while(nr<n)
    {
        minim(k);
        nr++;
        viz[k]=1;
        p=v[k];
        while(p)
        {
            if(d[p->x]>d[k]+p->c&&viz[p->x]==0)
            {
                d[p->x]=d[k]+p->c;
            }
            p=p->urm;
        }
    }
}
int main()
{
    f>>n;
    f>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        adaug(v[x],y,c);
    }
    for(i=2;i<=n;i++)
        d[i]=inf;
    p=v[1];
    while(p)
    {
        d[p->x]=p->c;
        //pred[p->x]=1;
        p=p->urm;
    }
    dijkstra(1);
    for(i=2;i<=n;i++)
    {
        if(d[i]==inf)
            g<<0<<" ";
        else
            g<<d[i]<<" ";
    }
    return 0;
}