#include <bits/stdc++.h>
using namespace std;

#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define trav(a, x) for (auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int N = 55555;
const int INF = 0x3f3f3f3f;

int n, m;
vector<pair<int, int>> adj[N];
int dist[N];

void dijkstra(int source) {
	for (int i = 0; i < N; i++) dist[i] = INF;
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
	pq.push({0, source});
	dist[source] = 0;
	while (!pq.empty()) {
		int u = pq.top().second;
		int d = pq.top().first;
		pq.pop();
		if (dist[u] < d) continue;
		for (pair<int, int> edge : adj[u]) {
			int v = edge.second;
			int weight = edge.first;
			int new_dist = dist[u] + weight;
			if (new_dist < dist[v]) {
				dist[v] = new_dist;
				pq.push({new_dist, v});
			}
		}
	}
}

int main() {
	freopen("dijkstra.in", "r", stdin);
	freopen("dijkstra.out", "w", stdout);
	cin.sync_with_stdio(false);
	cin.exceptions(cin.failbit);
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int u, v, weight;
		cin >> u >> v >> weight;
		u--, v--;
		adj[u].push_back({weight, v});
	}
	dijkstra(0);
	for (int i = 1; i < n; i++) {
		cout << (dist[i] == INF) ? "0" : dist[i] << " ";
	}
	cout << endl;
	exit(0);
}