#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
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; }
struct Edge {
	int to;
	long long cost;
	Edge(int _to, long long _cost) :to(_to), cost(_cost) {}
};
vector<Edge>g[200005];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<vector<Edge>>g(n);
	rep(i, m) {
		int a, b, c; cin >> a >> b >> c;
		a--, b--;
		g[a].push_back({ b,c });
		g[b].push_back({ a,c });
	}

	priority_queue<pair<long long, P>, vector<pair<long long, P>>, greater<pair<long long, P>>> q;
	q.push({ 0,{0,0} });
	q.push({ 0,{0,1} });
	vector<vector<long long>>dp(n, vector<long long>(2, LINF));
	dp[0][0] = 0;
	dp[0][1] = 0;
	while (!q.empty()) {
		auto tmp = q.top();
		q.pop();
		long long cost = tmp.first;
		int pos = tmp.second.first;
		int cnt = tmp.second.second;
		if (cost > dp[pos][cnt]) continue;
		for (Edge e : g[pos]) {
			rep(i, 2) {
				long long ncost = cost;
				if (0 == i)ncost += e.cost;
				int npos = e.to;
				int ncnt = cnt + i;
				if (ncnt >= 2)continue;
				if (chmin(dp[npos][ncnt], ncost)) q.push({ ncost, {npos,ncnt} });
			}
		}
	}
	rep(i, n) {
		long long ans = dp[i][0] + dp[i][1];
		cout << ans << endl;
	}
	return 0;
}