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

const int inf = (1 << 30) - 1;

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

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

    //                 sz, cost
    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});
    }

    priority_queue<
        pair<int,int>, // (dist[v],v)
        vector<pair<int,int>>,
        greater<pair<int,int>>> q;

    vector<int> dist(n+1, inf);
    q.push({0, 1});
    dist[1] = 0;

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

        if (dist[v] == dv) {
            int nsz = adj[v].size();
            for (int i = 0; i < nsz; i++) {
                int sz = adj[v][i].first;
                int el = adj[v][i].second;

                if (dist[sz] > dv + el) {
                    dist[sz] = dv + el;
                    q.push({dist[sz], sz});
                }
            }
        }
    }

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

    return 0;
}