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

using namespace std;

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

void dijkstra(int v, vector<int>&dist, int n, vector<vector<pair<int, int>>>&adj)
{
    dist[v] = 0;
    vector<int>tata(n+1);
    vector<bool>visited(n+1);

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
    pq.push({0, v});

    while(!pq.empty())
    {
        auto pr = pq.top();
        pq.pop();

        if(!visited[pr.second])
        {
            for(auto e : adj[pr.second])
            {
                if(dist[e.first] > dist[pr.second] + e.second)
                {
                    dist[e.first] = dist[pr.second] + e.second;
                    tata[e.first] = pr.second;
                    pq.push({dist[e.first], e.first});
                }
            }
            visited[pr.second] = true;
        }
    }
}
int main()
{
    int n, m;
    fin >> n >> m;
    vector<vector<pair<int, int>>>adj(n+1);
    for(int i = 0; i < m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        adj[x].push_back({y, c});
    }

    vector<int>dist(n+1, 1e9+1);
    dijkstra(1, dist, n, adj);

    for(int i = 2; i <= n; i++)
        if(dist[i] == 1e9+1)
            fout << 0 << " ";
        else
            fout << dist[i] << " ";
    return 0;
}