#include<iostream>
#include<vector>
#include<fstream>
#include<queue>
#define inf 1000000010
using namespace std;
int n;
int heap[50010],k=0;
long d[50010];

vector <pair<int,int> > v[50010];
priority_queue <pair<int,int> > h;

void citire();
void dijkstra();
void afisare();

int main(){
    citire();
    dijkstra();
    afisare();
}

void afisare(){
    int i;
    ofstream o("dijkstra.out");
    for(i=2;i<=n;i++){
        if(d[i]==inf) o<<0<<" ";
        else o<<d[i]<<" ";
    }
    o.close();
}
void initializare(){
    int i;
    for(i=2;i<=n;i++)
        d[i]=inf;
}
void dijkstra(){
    initializare();
    int nod,dis,nv,cv,i;
    h.push(make_pair(0,1));
    while(h.size()){
        nod=h.top().second;
        dis=h.top().first;
        dis=-dis;
        h.pop();
        if(dis>d[nod]) continue;
        for(i=0;i<v[nod].size();i++){
            nv=v[nod][i].first;
            cv=v[nod][i].second;
            if(dis+cv<d[nv]){
                d[nv]=dis+cv;
                h.push(make_pair(-d[nv],nv));
            }
        }
    }
}
void citire(){
    ifstream f("dijkstra.in");
    int m,x,y,c,i; f>>n>>m;
    for(i=1;i<=m;i++){
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    f.close();
}