#include <cstdio>

 #include <algorithm>

 #include <cstring>

 #include <queue>

 #include <vector> 

 using namespace std;

 const int N = ;

 const int inf = 0x3f3f3f3f;

 typedef struct

 {

     int to;

     int dis;

 }PP;

 int n,m;

 vector<PP> bian[N];

 int v[N];

 int vis[N];

 void bellman()

 {

     queue<int> que;

     int te,nt;

     que.push();

     vis[]=;

     int i;

     int dis;

     while(que.size()>=)

     {

         te=que.front();

         que.pop();

         for(i=;i<bian[te].size();i++){

             nt=bian[te][i].to;

             dis=bian[te][i].dis;

             if(v[nt]>v[te]+dis){

                 v[nt]=v[te]+dis;

                 if(vis[nt]==){

                     vis[nt]=;

                     que.push(nt);

                 }

             }

         }

         vis[te]=;

     }

 }

 int main()

 {

     int i,j;

     int uu,vv,l;

     PP te;

     //freopen("data.in","r",stdin);

     //while(scanf("%d%d",&n,&m)!=EOF)

     scanf("%d%d",&n,&m);

     {

         memset(vis,,sizeof(vis));

         fill(v,v+n+,inf);

         v[]=;

         for(i=;i<=n;i++){

             bian[i].clear();

             //printf(" i=%d v=%d\n",i,v[i]);

         }

         for(i=;i<=m;i++){

             scanf("%d%d%d",&uu,&vv,&l);

             te.to=vv;te.dis=l;

             bian[uu].push_back(te);

         }

         bellman();

         for(i=;i<=n;i++){

             printf("%d\n",v[i]);

         }

     }

     return ;

 }