#include <bits/stdc++.h>

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
int n, m;
int x, y, c;

void dijkstra(int start, vector<int>& dp, vector<vector<pair<int, int>>>& adj) {
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    vector<bool> done(n + 1, false);

    q.push({start, 0});

    while (!q.empty()) {
        int node = q.top().first;
        int cost = q.top().second;

        q.pop();

        if (done[node]) {
            continue;
        }

        done[node] = true;

        for (auto it : adj[node]) {
            if (dp[it.first] > cost + it.second) {
                dp[it.first] = cost + it.second;
                q.push({it.first, dp[it.first]});
            }
        }
    }
}

int main() {
    in >> n >> m;
    vector<vector<pair<int, int>>> adj(n + 1, vector<pair<int, int>>());

    for (int i = 1; i <= n; i++) {
        in >> x >> y >> c;
        adj[x].push_back({y, c});
    }

    vector<int> dp(n + 1, 1e9);
    dp[1] = 0;

    dijkstra(1, dp, adj);

    for (int i = 2; i <= n; i++) {
        out << dp[i] << ' ';
    }

    return 0;
}