#include <bits/stdc++.h>
#define NMAX 50001
#define inf 1000000001
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m, x, y, c;
int cost[NMAX];
vector < pair <int, int> > v[NMAX];
queue < pair <int, int> > q;

void read(){
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>c;
        v[x].push_back({y, c});
    }
}

void dji(){
    q.push({1, 0});
    while(!q.empty()){
        int nod = q.front().first;
        int dis = q.front().second;
        q.pop();
        for(int i=0;i<v[nod].size();i++){
            int vec = v[nod][i].first;
            int cos = v[nod][i].second;
            if(dis + cos < cost[vec]){
                cost[vec] = dis + cos;
                q.push({vec, cost[vec]});
            }
        }
    }
}

int main(){
    read();
    for(int i=2;i<=n;i++){
        cost[i] = inf;
    }
    dji();
    for(int i=2;i<=n;i++){
        if(cost[i]==inf){
            fout<<0<<" ";
        }else{
            fout<<cost[i]<<" ";
        }
    }
    return 0;
}