#include <bits/stdc++.h>

#define NMAX 50002

using namespace std;

ifstream f ("dijkstra.in");
ofstream g ("dijkstra.out");

const int INF = 1 << 30;

int n, viz[NMAX], d[NMAX], m;
vector< pair<int, int> > vecini[NMAX];

struct comp{
    bool operator()(int a, int b){
        return d[a] < d[b];
    }
};

priority_queue<int, vector<int>, comp> Q;

void dijkstra(int nod){
    viz[nod] = 1;
    d[nod] = 0;
    Q.push(nod);
    while(!Q.empty()){
        int k = Q.top();
        Q.pop();
       // viz[k] = 0;
        for(auto vecin : vecini[k]){
            int x = vecin.first;
            int cost = vecin.second;
            if(d[x] > d[k] + cost){
                d[x] = d[k] + cost;
                if(!viz[x]){
                    Q.push(x);
                    viz[x] = 1;
                }
            }
        }
    }
}

int main(){
    f >> n >> m;
    for(int i = 1; i <= m; i ++){
        int x, y, c;
        f >> x >> y >> c;
        vecini[x].push_back(make_pair(y, c));
    }
    for(int i = 1; i <= n; i ++) d[i] = INF;
    dijkstra(1);
    for(int i = 2; i <= n; i ++)
        if(d[i] == INF) d[i] = 0;
    for(int i = 2; i <= n; i ++){
        g << d[i] << " ";
    }
    return 0;
}