#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;

const int INF = 1e9;

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()) {
        auto [d, u] = pq.top();
        pq.pop();

        if (d > dist[u]) continue;

        for (auto &[v, cost] : adj[u]) {
            if (dist[u] + cost < dist[v]) {
                dist[v] = dist[u] + cost;
                pq.push({dist[v], v});
            }
        }
    }

    // afișăm distanțele către nodurile 2..N
    for (int i = 2; i <= N; i++) {
        if (dist[i] == INF) fout << 0 << " ";
        else fout << dist[i] << " ";
    }

    return 0;
}