//#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define f first
#define s second
using namespace std;

vector<pair<int,int>>v[50005];
priority_queue<pair<int,int>>pq;
int d[50005];
bool seen[50005];
int n,m,a,b,cost,x;
int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>a>>b>>cost;
        v[a].push_back({b,cost});
    }
    for(int i=2;i<=n;i++)
        d[i]=1<<31-1;
    pq.push({0,1});
    while(!pq.empty()){
        x=pq.top().second;
        pq.pop();
        if(seen[x]==0){
            seen[x]=1;
            for(auto it:v[x]){
                if(it.s+d[x]<d[it.f]){
                    d[it.f]=it.s+d[x];
                    pq.push({-d[it.f],it.f});
                }
            }
        }
    }
    for(int i = 2; i<=n; i++)
        if(d[i]==1<<31-1)
            cout<<"0 ";
        else
            cout<<d[i]<<" ";
}