#include <cstdio>
#include <cstdlib>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;


#define nmax 50010
#define inf 0x3f3f3f3f
#define mp make_pair
#define pb push_back

vector<pair<int, int> > G[nmax];
vector<pair<int, int> > :: iterator it;
int dist[nmax], N, M, X, Y, C;
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > Q;


void Dijkstra()
{
     memset(dist, inf, sizeof(dist));
     dist[1] = 0;
     Q.push(mp(0, 1));
     while(!Q.empty())
     {
                      int node = Q.top().second;
                      Q.pop();
                      for(it = G[node].begin(); it != G[node].end(); ++it)
                             if(dist[it -> first] > dist[node] + it -> second)
                                        dist[it -> first] = dist[node] + it -> second, 
                                        Q.push(mp(dist[it -> first], it -> first));
     }
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    int i;
    scanf("%i %i", &N, &M);
    for(i = 1; i <= M; i++)
    {
          scanf("%i %i %i", &X, &Y, &C);
          G[X].pb(mp(Y, C));
    }
    Dijkstra();
    for(i = 2; i <= N; i++)
          if(dist[i] == inf) printf("0 ");
          else printf("%i ", dist[i]);
    return 0;
}