#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define pii pair<int, int>
using namespace std;

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

const int NMAX = 5e5 + 5;
const char nl  = '\n';
const int INF = 1e9 + 7;
vector<pii> g[NMAX];
int dist[NMAX], vizita[NMAX];
void dijkstra (int source, int size) {
    for (int i = 1; i <= size; ++i) {
        dist[i] =INF;
    }
    priority_queue<pii>pq;
    dist[source] = 0;
    pq.push({0, source});
    while (!pq.empty()) {
        int cur_node = pq.top().second;
        pq.pop();

        for(auto neigh: g[cur_node]) {
            if(dist[neigh.first] > dist[cur_node] + neigh.second) {
                dist[neigh.first] = dist[cur_node] + neigh.second;
                pq.push({-dist[neigh.first], neigh.first});
            }
        }

    }
}

int main() {
    int n, m;

    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int u, v, w;
        fin >> u >> v >> w;
        g[u].push_back({v, w});
    }

    dijkstra(1,n);

    for (int i = 2; i <= n ; i++) {
        if (dist[i] == INF) {
            fout << 0 << ' ';
        }
        else {
            fout << dist[i] << " ";
        }
    }
}