#include <cstdio>
#include <vector>
#include <queue>
#define DIM 50005
#define INF 0x3f3f3f
#define pb push_back
using namespace std;


int dist[DIM];
int in_queueu[DIM];

vector < pair<int, int> > v[DIM];
priority_queue < pair<int, int> > Q;


int main()
{

    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);

    int n, m, i, j, x, y, c, s, t, d;

    scanf("%d%d",&n,&m);
    for( i = 1; i <= m; ++i ){
        scanf("%d%d%d",&x,&y,&c);
        v[x].pb({c,y});
    }

    for( i = 2; i <= n; ++i ) dist[i] = INF;

    Q.push({INF,1});
    in_queueu[1] = 1;
    while( !Q.empty() ){
        x = Q.top().second;
        Q.pop();
        for( i = 0; i < v[x].size(); ++i ){
            if( dist[v[x][i].second] > v[x][i].first + dist[x] ){
                dist[v[x][i].second] = v[x][i].first + dist[x];
                if( !in_queueu[v[x][i].second] ){
                    Q.push({v[x][i].first,v[x][i].second});
                    in_queueu[v[x][i].second] = 1;
                }
            }
        }
        in_queueu[x] = 0;
    }

    for( i = 2; i <= n; ++i )
      printf("%d ",dist[i]);


    return 0;

}