#include <bits/stdc++.h>
using namespace std;

const int NMAX = 5e4;
const int INF = 1e9;
vector<pair<int, int>> L[NMAX + 1];
int d[NMAX + 1];
int sel[NMAX + 1];
//(-d[nod], nod)
priority_queue<pair<int, int>> pq;

int main() {
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    int n, m;
    cin >> n >> m;
    //pair<int, int> p = {2, 4};
    //cout << p.first << '\n';
    //cout << p.second;
    for(int i = 1; i <= m; i++) {
        int x, y, c;
        cin >> x >> y >> c;
        L[x].push_back({y, c});
    }
    d[1] = 0;
    for(int i = 2; i <= n; i++) {
        d[i] = INF;
    }
    pq.push({-d[1], 1});
    while(pq.empty() == false) {
    //for(int i = 1; i <= n; i++) {
        //alegem nodul cu d-ul minim
        // int minim = INF;
        // int nod = 0;
        // for(int j = 1; j <= n; j++) {
        //     if(sel[j] == 0 && d[j] < minim) {
        //         minim = d[j];
        //         nod = j;
        //     }
        // }
        int nod = pq.top().second;
        pq.pop();
        sel[nod] = 1;
        for(int j = 0; j < L[nod].size(); j++) {
            int vec = L[nod][j].first;
            int cost = L[nod][j].second;
            if(d[vec] > d[nod] + cost) {
                d[vec] = d[nod] + cost;
                pq.push({-d[vec], vec});
            }
        }
    }
    for(int i = 2; i <= n; i++) {
        if(d[i] == INF) {
            d[i] = 0;
        }
        cout << d[i] << ' ';
    }

}