#include <fstream>
using namespace std;
ofstream fout("dijkstra.out");
int i,n,m,p,use[50001],d[50001],minim,j;
struct graf
{
    int nod,cost;
    graf *next;
} *a[50001];
void add(int x,int y,int z)
{
    graf *q=new graf;
    q->nod=y;
    q->cost=z;
    q->next=a[x];
    a[x]=q;
}
void citire()
{
    int x,y,z,i;
    FILE*fin;
    fin=fopen("dijkstra.in","r");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d%d",&x,&y,&z);
        add(x,y,z);
    }
}
void dijkstra()
{
    for(i=2; i<=n; i++)
        d[i]=1001;
    for(i=1; i<=n; i++)
    {
        minim=1001;
        for(j=1; j<=n; j++)
        {
            if(d[j]<minim&&!use[j])
            {
                minim=d[j];
                p=j;
            }
        }
        use[p]=1;
        graf *t=a[p];
        while(t)
        {
            if(d[t->nod]>d[p]+t->cost)
                d[t->nod]=d[p]+t->cost;

            t=t->next;
        }
    }
}
int main()
{
    citire();
    dijkstra();
    for(i=2;i<=n;i++)
        fout<<(d[i]!=1001 ? d[i] : 0)<<" ";
    return 0;
}