#include <fstream>
#include <vector>
#include <climits>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
struct muchie{
        int x;
        int c;
};
vector <muchie> v[100001];
int n,m,x,y,cost,d[100001],p,viz[100001],Min,i,j;
int main()
{
    cin>>n>>m;
    for(i=1;i<=m;i++){
        cin>>x>>y>>cost;
        v[x].push_back({y,cost});
    }
    for(i=2;i<=n;i++)
        if(d[i]==0)
            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;
}