#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
queue<int> pq;
vector<pair<int,int> > v[50005];
long long f[50005];
bool g[50005];
long long infi=99999999999;
int main()
{
    ifstream cin("bellmanford.in");
    ofstream cout("bellmanford.out");
    int n,m,x,y,cost;
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>cost;
        v[x].push_back(make_pair(y,cost));
    }
    f[1]=0;
    g[1]=1;
    for(int i=2;i<=n;i++){
        f[i]=infi;
    }
    pq.push(1);
    while(pq.empty()==false){
        x=pq.front();
        pq.pop();
        if(g[x]==0)
            continue;
        g[x]=0;
        for(int i=0;i<v[x].size();i++){
            if(f[v[x][i].first]>f[x]+v[x][i].second){
                g[v[x][i].first]=1;
                f[v[x][i].first]=f[x]+v[x][i].second;
                pq.push(v[x][i].first);
            }
        }
    }
    for(int i=2;i<=n;i++){
        cout<<f[i]<<" ";
    }
    return 0;
}