//#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
priority_queue<pair<int,int> > q;
vector<pair<int,int> > v[50005];
int d[50005];
int main()
{
    int n,m,a,b,c;
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    for(int i=1;i<=n;i++)
        d[i]=-1;
    q.push(make_pair(0,1));
    while(q.empty()==false){
        pair<int,int> x=q.top();
        q.pop();
        if(d[x.second]!=-1){
            continue;
        }
        d[x.second]=-x.first;
        for(auto u:v[x.second]){
            q.push(make_pair(x.first-u.second,u.first));
        }
    }
    for(int i=2;i<=n;i++){
        if(d[i]==-1){
            d[i]=0;
        }
        cout<<d[i]<<" ";
    }
    return 0;
}