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

using namespace std;

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

int n, m;
vector<pair<int, int>>adj[50005];
vector<int>dist(50005);

void dijkstra(int v)
{
    vector<bool>visited(50005);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;
    vector<int>tata(50005);

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

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

        int nod = pr.second;

        if(!visited[nod]){
        for(auto n : adj[nod])
        {
            int vecin = n.first;
            int cost = n.second;
            if(dist[vecin] > dist[nod] + cost)
                {
                    dist[vecin] = dist[nod] + cost;
                    tata[vecin] = nod;
                    pq.push({dist[vecin], vecin});
                }


        }
            visited[nod] = true;
        }
    }

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

    }

    for(int i = 1; i <= n; i++)
        dist[i] =1e9 + 1;

    dijkstra(1);

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


    return 0;
}