#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#define nmx 50005
#define inf 0x3f3f3f3f
using namespace std;

int n, dist[nmx];
vector <pair<int,int> > g[nmx]; /// nod, cost
priority_queue <pair<int,int> > q;

void citire_graf(){
    int m, nod1, nod2, cost;
    scanf("%d %d", &n, &m);
    for(; m; --m){
        scanf("%d %d %d", &nod1, &nod2, &cost);
        g[nod1].push_back(make_pair(nod2,cost));
    }
}

void dijkstra(){
    memset(dist, inf, sizeof(dist));
    int nod;
    q.push(make_pair(0,1));
    dist[1] = 0;
    while(not q.empty()){
        nod = q.top().second;
        q.pop();
        for(vector<pair<int,int> >::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
        if(dist[it->first] > dist[nod] + it->second){
            dist[it->first] = dist[nod] + it->second;
            q.push(make_pair(-dist[it->first],it->first));
        }
    }
}

int main(){
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    citire_graf();
    dijkstra();
    for(int i = 2; i <= n; ++i)
        printf("%d ", dist[i] == inf ? 0 : dist[i]);
    return 0;
}