#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	freopen("dijkstra.in", "r", stdin);
	freopen("dijkstra.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	vector<pair<int,int>> adjl[n];
	for (int i = 0; i < m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		u--, v--;
		adjl[u].emplace_back(w, v);
	}

	const int oo = 1<<29;
	vector<int> dist(n, oo);
	dist[0] = 0;
	priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
	pq.emplace(0, 0);

	do {
		int u = pq.top().second;
		int d = pq.top().first;
		pq.pop();
		if (d > dist[u]) {
			continue;
		}
		for (auto e: adjl[u]) {
			int v = e.second;
			int w = e.first;
			if (dist[v] > dist[u]+w) {
				dist[v] = dist[u]+w;
				pq.emplace(dist[v], v);
			}
		}
	} while (!pq.empty());

	for (int i = 1; i < n; i++) {
		printf("%d%s", dist[i] < oo ? dist[i] : 0, i < n-1 ? " " : "\n");
	}
}