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

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

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

    vector<vector<pair<int,int>>> L(n + 1);

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

    const int INF = (n - 1) * 20000 + 1;
    vector<int> d(n + 1, INF);
    vector<int> vis(n + 1, 0);
    priority_queue<pair<int, int>> pq;

    d[1] = 0;
    pq.push({0, 1});

    while (!pq.empty()) 
    {
        int nod = pq.top().second;
        pq.pop();
        if(vis[nod]) continue;
        vis[nod] = 1;

        for (auto [vecin, cost] : L[nod])
            if (d[vecin] > d[nod] + cost)
            {
                d[vecin] = d[nod] + cost;
                pq.push({-d[vecin], vecin});
            }
    }

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

    fin.close();
    fout.close();
    return 0;
}