#include <fstream>
#include <vector>
#include <climits>
#include <queue>
using namespace std;
struct muchie{
    int x,c;
};
int n,m,a,b,cost,i,j,d[50001],viz[50001],p,Min;
vector <muchie> v[50001];
int main(){

    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin>>n>>m;
    for(i=1;i<=m;i++){
        cin>>a>>b>>cost;
        v[a].push_back({b,cost});
    }
    for(i=2;i<=n;i++)
        d[i]=INT_MAX;
    d[1]=0;
    for(i=0;i<v[1].size();i++)
        d[v[1][i].x]=v[1][i].c;

    viz[1]=1;
    for(i=1;i<=n-1;i++){
        Min=INT_MAX;
        for(j=1;j<=n;j++)
            if(viz[j]==0 && d[j]<Min){
                Min=d[j];
                p=j;
            }
        viz[p]=1;
        for(j=0;j<v[p].size();j++)
            if(d[v[p][j].x]>d[p]+v[p][j].c)
                d[v[p][j].x]=d[p]+v[p][j].c;
    }
    for(i=2;i<=n;i++){
        if(d[i]==INT_MAX)
            d[i]=0;
        cout<<d[i]<<" ";
    }
    return 0;
}