#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int INF = 2000000000;

int main() {
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");

    int N, M;
    fin >> N >> M;

    vector<vector<pair<int, int>>> adj(N + 1);
    for (int i = 0; i < M; ++i) {
        int A, B, C;
        fin >> A >> B >> C;
        adj[A].push_back({B, C});
    }

    vector<int> dist(N + 1, INF);
    dist[1] = 0;

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({0, 1});

    while (!pq.empty()) {
        int d = pq.top().first;
        int u = pq.top().second;
        pq.pop();

        if (d > dist[u]) continue;

        for (auto edge : adj[u]) {
            int v = edge.first;
            int weight = edge.second;
            if (dist[u] + weight < dist[v]) {
                dist[v] = dist[u] + weight;
                pq.push({dist[v], v});
            }
        }
    }

    for (int i = 2; i <= N; ++i) {
        if (dist[i] == INF) {
            fout << 0;
        } else {
            fout << dist[i];
        }
        if (i < N) {
            fout << " ";
        }
    }

    fin.close();
    fout.close();

    return 0;
}