#include <fstream>
#include <climits>
#include <vector>
#include <queue>
#define nmax 50002
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,x,y,c,d[nmax];
struct arc{
int nod,cost;
};
vector<arc>v[nmax];
bool viz[nmax];
struct cmp{
    bool operator()(const arc& a,const arc& b){
        return a.cost>b.cost;
    }
};
priority_queue<arc,vector<arc>,cmp>q;
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(int i=2;i<=n;i++){
        d[i]=INT_MAX;
    }
    q.push({1,0});
    while(!q.empty()){
        int p=q.top().nod;
        q.pop();
        if(viz[p])
            continue ;
        viz[p]=1;
        for(auto i: v[p])
            if(d[i.nod]>d[p]+i.cost&&viz[i.nod]==0){
                d[i.nod]=d[p]+i.cost;
                q.push({i.nod,d[i.nod]});
            }
    }
    for(int i=2;i<=n;i++){
        if(d[i]==INT_MAX)
            d[i]=0;
        cout<<d[i]<<" ";
    }
    return 0;
}