#include<iostream>
#include<fstream>
#include<vector>
#include<limits.h>
#include<queue>
#define N 50010
using namespace std;

ifstream f("dijkstra.in");
ofstream o("dijkstra.out");

vector <pair<int,int> > v[N];
priority_queue <pair<int,int> > h;
int n,m; bool viz[N];
long d[N];

void citire(){
    f>>n>>m; int i,x,y,c;
    for(i=1;i<=m;i++){
        f>>x>>y>>c;
        //cout<<x<<" "<<y<<" "<<c<<endl;
        v[x].push_back(make_pair(y,c));
    }
}
void init(){
    d[1]=0;
    int i;
    for(i=2;i<=n;i++)
        d[i]=LONG_MAX;
    h.push(make_pair(0,1));
}
void dijkstra(){
    init(); int i,nod,dnod,nv,dv;
    while(h.size()){
        nod=h.top().second;
        dnod=-(h.top().first);
        h.pop();
        if(dnod>d[nod]) continue;
        for(i=0;i<v[nod].size();i++){
            nv=v[nod][i].first;
            dv=v[nod][i].second;
            //cout<<d[nod]<<" "<<dv<<" "<<nv<<" "<<d[nv]<<endl;
            if(d[nod]+dv<d[nv]){
                d[nv]=d[nod]+dv;
                h.push(make_pair(-d[nv],nv));
            }
        }
    }
}
int main(){
    citire();
    dijkstra();
    int i;
    for(i=2;i<=n;i++)
        if(d[i]==LONG_MAX) o<<"0 ";
        else o<<d[i]<<" ";
}