#include <bits/stdc++.h>
using namespace std;

struct fcmp {
    bool operator()(const pair<int, int>& a, const pair<int, int>& b) {
        return a.second > b.second;
    }
};

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, x, y, c; i < m; ++i) {
        fin >> x >> y >> c;
        adj[x].push_back(make_pair(y, c));
    }

    priority_queue<pair<int, int>, vector<pair<int, int>>, fcmp> pq;
    vector<bool> visited(n + 1);
    vector<int> d(n + 1, INT_MAX);
    d[1] = 0;

    pq.push(make_pair(1, 0));
    while (!pq.empty()) {
        auto [nod, _] = pq.top(); pq.pop();

        if (visited[nod]) continue;
        visited[nod] = true;

        for (auto& [vec, cost] : adj[nod]) {
            if (d[vec] > d[nod] + cost) {
                d[vec] = d[nod] + cost;
                pq.emplace(vec, d[vec]);
            }
        }
    }

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

    return 0;
}