#include <bits/stdc++.h>

using namespace std;

const int Inf = 1e9 + 5;
const int Dim = 3e5 + 5;

int n, m;
int d[Dim];

bool viz[Dim];

vector <pair<int, int> > G[Dim];
priority_queue <pair<int, int> > coada;

int main() {
    freopen("dijkstra.in" , "r" , stdin);
    freopen("dijkstra.out" , "w" , stdout);

    scanf("%d %d", &n, &m);
    for(int i = 1; i <= m; ++i) {
        int x, y, cost;
        scanf("%d %d %d", &x, &y, &cost);
        G[x].push_back({y, cost});
    }

    for(int i = 1; i <= n; ++i) d[i] = Inf;
    d[1] = 0;

    coada.push({0, 1});
    while(!coada.empty()) {
        int node = coada.top().second;
        coada.pop();

        if(viz[node] == 0) {
            viz[node] = 1;
            for(auto it = G[node].begin(); it != G[node].end(); ++it) {
                if(d[it -> first] > d[node] + it -> second) {
                    d[it -> first] = d[node] + it -> second;
                    coada.push({-d[it -> first], it -> first});
                }
            }
        }
    }

    for(int i = 2; i <= n; ++i) {
        if(d[i] == Inf) d[i] = 0;
        printf("%d ", d[i]);
    }
    return 0;
}