#include <stdio.h>
struct cod
{
int x;
cod *urm;
};
struct nod
{
int vf,c;
nod *urm;
};
typedef nod *lista;
typedef cod *coada;

lista A[50001];
coada que,ultim;
int C[50001];

void add(int x)
{
coada urm;
if (que==NULL)
             {
             urm = new cod;
             urm->x = x;
             //urm->c = c;
             urm->urm = NULL;
             que = urm;
             ultim = que;
             }
else {
     urm = new cod;
     urm->x = x;
     //urm->c = c;
     urm->urm = NULL;
     ultim->urm = urm;
     ultim = urm;
     }
}

void BF()
{
lista w;
int c,x,y;
while (que!=NULL)
{
w = A[que->x];
c = C[que->x];
while (w!=NULL)
{
x = w->vf; y= w->c;
if (C[x]>c+y || C[x]==0) C[x]=c+y,add(x);
w = w->urm;
}
que =que->urm;
}
}

int main()
{
FILE *in = fopen("dijkstra.in","r");
FILE *out = fopen("dijkstra.out","w");
int n,i,m,x,y,c;
lista urm;
fscanf(in,"%d%d",&n,&m);
for (;m;m--)
{
fscanf(in,"%d%d%d",&x,&y,&c);
urm = new nod;
urm->vf = y;
urm->c = c;
urm->urm = A[x];
A[x] = urm;
}
add(1);
BF();
for (i=2;i<=n;i++) fprintf(out,"%d ",C[i]);
}