# include <stdio.h>

# define FIN "dijkstra.in"
# define FOUT "dijkstra.out"
# define MAXN 50005
# define inf 1 << 20

struct pelem
{
   int info,cost;
   pelem *next;
};

int N,M,i,j,a,b,c,len,mini;
pelem *list[MAXN];
pelem *p;
int H[MAXN];
int D[MAXN];
int poz[MAXN];
    
    int main()
    {
        freopen(FIN,"r",stdin);
        freopen(FOUT,"w",stdout);
        
        scanf("%d%d",&N,&M);
        for (i = 1; i <= M; ++i)
          {
              scanf("%d%d%d",&a,&b,&c);
              p = new pelem;
              p->info = b;
              p->cost = c;
              p->next = list[a];
              list[a] = p;
          }
        
        for (i = 2; i <= N; ++i)
          if (D[i] == inf) printf("0 ");
            else printf("%d ",D[i]);
            
        return 0;
        
    }