#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 50000;
int d[NMAX + 1], vis[NMAX + 1];
vector<pair<int, int>> G[NMAX + 1];
set<pair<int, int>> s;

int main() {
    int n, m;
    f >> n >> m;
    while(m--) {
        int x, y, c;
        f >> x >> y >> c;
        G[x].push_back({y, c});
    }
    for(int i = 1; i <= n; i++) {
        d[i] = 1e9;
    }
    d[1] = 0;
    s.insert({d[1], 1});
    while(!s.empty()) {
        pair<int, int> p = *(s.begin());
        int node = p.second;
        s.erase(s.begin());
        if(vis[node]) {
            continue;
        }
        vis[node] = 1;
        for(int i = 0; i < G[node].size(); i++) {
            int next = G[node][i].first;
            int cost = G[node][i].second;
            if(d[node] + cost < d[next]) {
                //s.erase(s.find({d[next], next}));
                d[next] = d[node] + cost;
                s.insert({d[next], next});
            }
        }
    }
    for(int i = 2; i <= n; i++) {
        if(d[i] == 1e9) {
            d[i] = 0;
        }
        g << d[i] << ' ';
    }
    return 0;
}