#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <fstream>

using namespace std;

ifstream f ("dijkstra.in");
ofstream g ("dijkstra.out");

int main()
{
    int n, m;
    f >> n >> m;
    vector<pair<int, int>> G[n+1];
    for(int i = 1; i <= m; i++)
    {
        int u, v, w;
        f >> u >> v >> w;
        G[u].push_back({v, w});
    }
    int dist[n+1];

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

    dist[1] = 0;
    for(int i = 2; i <= n; i++)
        dist[i] = INT_MAX;
    H.push({0, 1});

    while (H.size() > 0)
    {
        auto [d, nod] = H.top();
        H.pop();
        if (d > dist[nod]) continue;
        for (auto [vecin, pond] : G[nod])
        {
            if (dist[vecin] > dist[nod] + pond)
            {
                dist[vecin] = dist[nod] + pond;
                H.push({dist[vecin], vecin});
            }
        }
    }

    for(int i = 2; i <= n; i++)
        g << dist[i] << " ";

    f.close();
    g.close();
    return 0;
}