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

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

const int INF = 1e9;

int main() {
    int n, m;
    fin >> n >> m;

    vector<vector<pair<int,int>>> adj(n + 1);
    vector<int> dist(n + 1, INF);

    for (int i = 0; i < m; i++) {
        int a, b, c;
        fin >> a >> b >> c;
        adj[a].push_back(make_pair(b, c));
    }

    priority_queue<
        pair<int,int>,
        vector<pair<int,int>>,
        greater<pair<int,int>>
    > pq;

    dist[1] = 0;
    pq.push(make_pair(0, 1));

    while (!pq.empty()) {
        pair<int,int> p = pq.top();
        pq.pop();

        int d = p.first;
        int u = p.second;

        if (d != dist[u]) continue;

        for (int i = 0; i < (int)adj[u].size(); i++) {
            int v = adj[u][i].first;
            int cost = adj[u][i].second;

            if (dist[u] + cost < dist[v]) {
                dist[v] = dist[u] + cost;
                pq.push(make_pair(dist[v], v));
            }
        }
    }

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

    return 0;
}