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

const int inf = INT_MAX / 2;

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

    int n, m;
    fin >> n >> m;

    //                 sorszam, koltseg
    vector<vector<pair<int,int>>> adj(n+1);

    for (int i = 0; i < m; i++) {
        int a, b, cost;
        fin >> a >> b >> cost;

        adj[a].push_back({b, cost});
    }

    vector<int> dist(n+1, inf);
    dist[1] = 0;

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

    q.push({dist[1], 1});

    while (!q.empty()) {
        int v = q.top().second;
        int dv = q.top().first;
        q.pop();

        if (dist[v] == dv) {
            int n_adj = adj[v].size();
            for (int i = 0; i < n_adj; i++) {
                int w = adj[v][i].first;
                int c = adj[v][i].second;

                if (dist[w] > dv + c) {
                    dist[w] = dv+c;
                    q.push({dist[w], w});
                }
            }
        }
        // else -> out of date
    }

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