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

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

int n, m, x, y, cost;
vector<vector<pair<int, int>>> adj;

vector<int> dijkstra(int src)
{
    vector<int> dist(n + 1, INT_MAX);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

    dist[src] = 0;
    pq.push({0, src});

    while (!pq.empty())
    {
        auto [d, u] = pq.top();
        pq.pop();
        if (d > dist[u]) continue;

        for (auto [v, w] : adj[u])
        {
            if (dist[v] > dist[u] + w)
            {
                dist[v] = dist[u] + w;
                pq.push({dist[v], v});
            }
        }
    }
    return dist;
}

int main()
{
    fin >> n >> m;
    adj.resize(n + 1);

    for (int i = 0; i < m; i++)
    {
        fin >> x >> y >> cost;
        adj[x].push_back({y, cost});
    }

    vector<int> res = dijkstra(1);

    for (int i = 2; i <= n; i++)
        fout << (res[i] == INT_MAX ? 0 : res[i]) << " ";
    return 0;
}