#include <bits/stdc++.h>

using namespace std;

ifstream in("dijsktra.in");
ofstream out("dijsktra.out");

vector<vector<pair<int, int >>> graph;
vector<int> dist;
priority_queue<pair<int, int>> q;

int n, m;

// Dijkstra Algorithm
void Dijsktra(int start) {
    q.push({0, start});
    dist[start] = 0;

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

        for (auto neigh: graph[node]) {
            int next = neigh.first;
            int cost = neigh.second;
            if (dist[node] + cost < dist[next]) {
                dist[next] = dist[node] + cost;
                q.push({dist[next], next});
            }
        }
    }
}

int main() {
    in >> n >> m;
    graph.resize(n + 1);
    dist.assign(n + 1, INT_MAX);

    for (int i = 0; i < m; i++) {
        int x, y, c;
        in >> x >> y >> c;
        graph[x].push_back({y, c});
    }

    Dijsktra(1);

    for (int i = 2; i <= n; ++i) {
        if (dist[i] == INT_MAX)
            out << 0 << ' ';
        else
            out << dist[i] << ' ';
    }

    in.close();
    out.close();
    return 0;
}