#include <bits/stdc++.h>

using namespace std;

ifstream fin  ("dijkstra.in");
ofstream fout ("dijkstra.out");

int n, m, i, a, b, c, nod, cost, vecin;
int d[50005];

vector <pair<int, int> > L[50005];

set <pair <int, int> > s;

int main(){
    fin >> n >> m;
    for (i=1; i<=m; i++){
        fin >> a >> b >> c;
        L[a].push_back ({b, c});
    }
    for (i=2; i<=n; i++){
        d[i] = INT_MAX;
    }
    s.insert ({0, 1});
    while (!s.empty()){
        nod = s.begin()->second;
        s.erase(s.begin());
        for (i=0; i<L[nod].size(); i++){
            vecin = L[nod][i].first, cost = L[nod][i].second;
            if (d[nod] + cost < d[vecin]){
                s.erase ({d[vecin], vecin});
                d[vecin] = d[nod] + cost;
                s.insert ({d[vecin], vecin});
            }
        }
    }
    for (i=2; i<=n; i++){
        if (d[i] == INT_MAX){
            fout << 0 << " ";
        }
        else{
            fout << d[i] << " ";
        }
    }
    return 0;
}
//recapitulare