#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
using namespace std;

#define nmax 50010
#define pb push_back
#define mp make_pair
#define to first
#define cost second

const int INF = 0x3f3f3f3f;

vector< pair<long, long> >nodes[nmax];
vector<long> distances(nmax,INF);
vector<bool> InQueue(nmax);
long n,m,x,y,c;


void read_input()
{
     scanf("%ld %ld", &n,&m);
     for(int i=0;i<m;i++)
     {
                     scanf("%ld %ld %ld", &x,&y,&c);
                     nodes[x].pb(mp(y,c));
     }
}


void BellmanFord()
{
     distances[1]=0;
     queue<long> q;
     q.push(1);
     InQueue[1]=true;
     vector< pair<long,long> >::iterator it;
     while(!q.empty())
     {
                      int nod=q.front();
                      q.pop();
                      InQueue[nod]=false;
                      for(it=nodes[nod].begin();it!=nodes[nod].end();++it)
                      {
                              if(distances[it->to]>distances[nod]+it->cost)
                              {
                                         distances[it->to]=distances[nod]+it->cost;
                                         if(InQueue[it->to]==false)
                                         {
                                                    q.push(it->to);
                                                    InQueue[it->to]=true;
                                         }
                              }
                      }
     }                                             
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    read_input();
    BellmanFord();
    for(int i=2;i<=n;i++) if(distances[i]==INF) printf("0 "); else printf("%ld ", distances[i]);
    return 0;
}