#include <bits/stdc++.h>

using namespace std;

priority_queue<pair<int, int>> pq;
vector<pair<int, int>> adj[250005];
int save[250005];

int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");

    int n, m, a, b, val;
    cin>>n>>m;

    for(int i=0; i<=n; i++)
        save[i] = 21e8;

    for(int i=0; i<m; i++)
    {
        cin>>a>>b>>val;
        adj[a].push_back({b, val});
    }

    save[1] = 0;
    pq.push({0, 1}); /// <cost pana acolo, nod>

    while(!pq.empty())
    {
        int curr_cost = pq.top().first, curr_nod = pq.top().second;
        pq.pop();

        for(auto x : adj[curr_nod])
        {
            int nou_nod = x.first, nou_cost = x.second;
            if(save[nou_nod] > curr_cost + nou_cost)
            {
                save[nou_nod] = curr_cost + nou_cost;
                pq.push({curr_cost + nou_cost, nou_nod});
            }
        }
    }

    for(int i=2; i<=n; i++)
        cout<<save[i]<<" ";

    return 0;
}