#include <stdio.h>
#define max 100010
#define inf 10000000
struct lista
{
    int nod,cost;
    lista *next;
};
lista *g[max],*p;
int n,m,j,d[max],t[max],u[max],min,pmin,i,c,s=1,k;
void push(int i,int j,int c)
{
    lista *p=new lista;
    p->cost=c;
    p->nod=j;
    p->next=g[i];
    g[i]=p;
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(; m>0; m--)
    {
        scanf("%d%d%d",&i,&j,&c);
        push(i,j,c);//push(j,i,c);
    }
    for(i=2; i<=n; i++) d[i]=inf;
    for(k=1; k<=n; k++)
    {
        min=inf; pmin=-1;
        for(i=1; i<=n; i++)
         if(!u[i] && min>d[i])
          min=d[i],pmin=i;
        u[pmin]=1;
        for(p=g[pmin]; p!=NULL; p=p->next)
         if(d[p->nod]>d[pmin]+p->cost)
         {
             d[p->nod]=d[pmin]+p->cost;
             t[p->nod]=pmin;
         }
    }
    for(i=2; i<=n; i++)
     if(d[i]!=inf) printf("%d ",d[i]);
    else printf("0 ");
    return 0;
}