// #include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

vector<int> dijkstra(vector<vector<pair<int, int>>>& edges, int src = 0) {
	int n = edges.size();
	const int max_dist = 1e9 + 5;
	vector<int> dist(n, max_dist);
	priority_queue<pair<int, int>> pq;

	pq.push({0, src});
	dist[src] = 0;

	while (!pq.empty()) {
		int node = pq.top().second;
		int cost = -pq.top().first;
		pq.pop();

		if (cost != dist[node]) { continue; }

		for (int i = 0; i < edges[node].size(); i++) {
			int next = edges[node][i].first;
			int c = edges[node][i].second;
			if (cost + c < dist[next]) {
				dist[next] = cost + c;
				pq.push({-dist[next], next});
			}
		}
	}

	for (int i = 0; i < n; i++) {
		if (dist[i] == max_dist) {
			dist[i] = 0;
		}
	}

	return dist;
}

int main() {
	int n, m; cin >> n >> m;
	vector<vector<pair<int, int>>> edges(n);
	for (int i = 0; i < m; i++) {
		int a, b, c; cin >> a >> b >> c;
		a--; b--;
		edges[a].push_back({b, c});
	}

	vector<int> dist = dijkstra(edges);

	for (int i = 1; i < n; i++) {
		cout << dist[i] << " ";
	}
	cout << "\n";
}