#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <bitset>
#include <stack>
#include <queue>
#include <deque>

using namespace std;

#ifdef LOCAL
ifstream fin("input.txt");
#define fout cout
#else
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
#endif

typedef pair<int, int> IPair;

const int NMAX = 5e4+5;
const int INF = 2e9;

int n, m;
vector<IPair> a[NMAX];
priority_queue<IPair, vector<IPair>, greater<IPair>> pq;
int dist[NMAX];

void read() {
	fin >> n >> m;
	int x, y, d;
	while (m--) {
		fin >> x >> y >> d;
		a[x].push_back({y, d});
	}
}

void solve() {
	for (int i = 2; i <= n; i++)
		dist[i] = INF;
	pq.push({0, 1});

	while (!pq.empty()) {
		int u = pq.top().second;
		pq.pop();
		for (auto &it : a[u]) {
			int v = it.first;
			int d = it.second;
			if (dist[v] > dist[u] + d) {
				dist[v] = dist[u] + d;
				pq.push({dist[v], v});
			}
		}
	}

	for (int i = 2; i <= n; i++)
		fout << (dist[i] != INF ? dist[i] : 0) << ' ';
}

int32_t main() {
	read();
	solve();
	return 0;
}