#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
#define NMAX 50005

using namespace std;

vector <pair<int, int> > v[NMAX];
queue <int> q;
int dist[NMAX], N;
bool viz[NMAX];
int inf = 1<<28;

void dijkstra(int N){
    int nod;
    for(int i = 1; i <= NMAX; ++i)
        dist[i] = inf;
    memset(viz, 0, sizeof(viz));
    q.push(1);
    dist[1] = 0;
    viz[1] = 1;
    while(!q.empty()){
        nod = q.front();
        viz[nod] = 0;
        q.pop();
        for(vector <pair <int, int> > :: iterator it = v[nod].begin(); it != v[nod].end(); ++it)
            if(dist[nod] + (*it).second < dist[(*it).first]){
                dist[(*it).first] = dist[nod] + (*it).second;
                if(!viz[(*it).first]){
                    q.push((*it).first);
                    viz[(*it).first] = 1;
                }
            }
    }
    for(int i = 2; i <= N; ++i)
        if(dist[i] == inf)
            printf("0 ");
        else printf("%d ", dist[i]);
}

int main(){
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    int M, x, y, c;
    scanf("%d %d", &N, &M);
    for(int i = 1; i <= M; ++i){
        scanf("%d %d %d", &x, &y, &c);
        v[x].push_back(make_pair(y, c));
    }
    dijkstra(N);
    return 0;
}