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

int n, m;
vector<vector<pair<int, int>>> adj;
vector<int> dist;
vector<int> viz;

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

void dijkstra(int start)
{
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dist[start] = 0;
    viz[start] = 1;
    pq.push({dist[start], start});
    while (!pq.empty())
    {
        int u = pq.top().second;
        pq.pop();
        for (auto edge : adj[u])
        {
            int v = edge.second;
            int cost = edge.first;
            if (!viz[v] && dist[u] + cost < dist[v])
            {
                dist[v] = dist[u] + cost;
                pq.push({dist[v], v});
                viz[v] = 1;
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    viz.assign(n + 1, 0);
    adj.assign(n + 1, {});
    dist.assign(n + 1, 20000001);
    for (int i = 0; i < m; i++)
    {
        int u, v, w;
        fin >> u >> v >> w;
        adj[u].push_back({w, v});
    }
    dijkstra(1);
    for (int i = 2; i < n + 1; i++)
    {

        fout << dist[i] << " ";
    }
    return 0;
}