#include <bits/stdc++.h>

using namespace std;

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

int d[500005], vis[500005];
priority_queue<pair<int,int>> pq;
vector<pair<int, int>> L[50001];
int main() {
    int n, m;
    f >> n >> m;
    for (int i=1; i<=m; i++) {
        int x, y, c;
        f >> x >> y >> c;
        L[x].push_back({y,c});
    }
    for (int i=1; i<=n; i++) {
        d[i] = INT_MAX;
    }
    d[1] = 0;
    pq.push({-d[1],1});
    while (!pq.empty()) {
        int nod = pq.top().second;
        pq.pop();
        if (vis[nod]== 1) continue;
        vis[nod] = 1;
        for (auto e : L[nod]) {
            int vecin = e.first;
            int cost = e.second;
            if (d[vecin] > d[nod] + cost) {
                d[vecin] = d[nod] + cost;
                pq.push({-d[vecin], vecin});
            }
        }
    }
     for (int i = 2; i <= n; i++) {
        if (d[i] == INT_MAX) g << 0 << " ";
        else g << d[i] << " ";
    }
    return 0;
}