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

#define INF 1 << 30

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

    int n, m, x, y, z;

    in >> n >> m;

    vector<vector<int>> g(n+1);
    vector<vector<int>> d(n+1);

    for (int i = 0; i < m; ++i)
    {
        in >> x >> y >> z;
        g[x].push_back(y);
        d[x].push_back(z);
    }

    //vector<int> vis(n+1);
    //vector<int> prev(n+1);
    vector<int> dist(n+1, INF);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;

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

    while (!pq.empty()) {
        auto [current_dist, u] = pq.top();
        pq.pop();

        if (current_dist > dist[u]) continue;

        //auto it = find(q.begin(), q.end(), u);
        //if (it != q.end()) q.erase(it);

        for (int i = 0; i < g[u].size(); ++i) {
            int v = g[u][i];
            int weight = d[u][i];

            //if (find(q.begin(), q.end(), v) != q.end()) {
                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.emplace(dist[v], v);
                }
            //}
        }
    }

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

    in.close();
    out.close();
    return 0;
}