#include <iostream>
#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <queue>

using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
int n, m, a, b, c;
vector<pair<int, int>> g[50001];
int d[50001], viz[50001];
struct compara
{
    bool operator()(int x, int y)
    {
        return d[x] > d[y];
    }
};
priority_queue<int, vector<int>, compara> q;
void Dijkstra (int start_node)
{
    for(int i=1; i<=n; i++) d[i]=INT_MAX/2;
    d[start_node]=0; viz[start_node]=1;
    q.push(start_node);
    while(!q.empty())
    {
        int crt_node=q.top();
        q.pop();
        viz[crt_node]=0;
        for(size_t i=0; i<g[crt_node].size(); i++)
        {
            int vecin=g[crt_node][i].first;
            int cost=g[crt_node][i].second;
            if(d[crt_node]+cost<d[vecin]){
                d[vecin]=d[crt_node]+cost;
                if(!viz[vecin])
                {
                    q.push(vecin);
                    viz[vecin]=1;
                }
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    while(fin>>a>>b>>c)
        g[a].push_back(make_pair(b, c));
    Dijkstra(1);
    for(int i=2; i<=n; i++){
        if(d[i]==INT_MAX/2)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}