#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	vector<vector<pii>> g(N);
	REP(i, M) {
		int a, b, c;
		scanf("%d %d %d", &a, &b, &c);
		--a; --b;
		g[a].emplace_back(b, c);
		g[b].emplace_back(a, c);
	}
	
	using tup = tuple<int, ll, int>; // used, cost, pos
	priority_queue<tup, vector<tup>, greater<tup>> pq;
	vector dist(N, vector(2, longINF));
	pq.emplace(0, 0, 0);
	dist[0][0] = 0;
	
	while (!pq.empty()) {
		auto [used, cost, u] = pq.top(); pq.pop();
		if (dist[u][used] < cost) continue;
		
		for (auto [v, c] : g[u]) {
			if (!used && chmin(dist[v][true], cost)) pq.emplace(true, cost, v);
			if (chmin(dist[v][used], cost + c)) pq.emplace(used, cost + c, v);
		}
	}
	
	REP(i, N) printf("%lld\n", i == 0 ? 0 : dist[i][0] + dist[i][1]);
}