#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <tuple>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

typedef tuple<int, int, int> T;
priority_queue<T, vector<T>, greater<T>> que;

int INF = 1e+15;
int n, m;
vector<int> et[100000];
vector<int> ec[100000];
int dist[100000][2];

signed main() {
	int i, j;
	
	cin >> n >> m;
	rep(i, m) {
		int a, b, c;
		cin >> a >> b >> c; a--; b--;
		et[a].push_back(b);
		et[b].push_back(a);
		ec[a].push_back(c);
		ec[b].push_back(c);
	}
	
	rep(i, n) rep(j, 2) dist[i][j] = INF;
	que.push(T(0, 0, 0));
	dist[0][0] = 0;
	
	while (!que.empty()) {
		T now = que.top(); que.pop();
		int cst = get<0>(now);
		int pos = get<1>(now);
		int kai = get<2>(now);
		rep(i, et[pos].size()) {
			int npos = et[pos][i];
			if (kai == 0) {
				if (dist[npos][1] > cst) {
					que.push(T(cst, npos, 1));
					dist[npos][1] = cst;
				}
			}
			if (dist[npos][kai] > cst + ec[pos][i]) {
				que.push(T(cst + ec[pos][i], npos, kai));
				dist[npos][kai] = cst + ec[pos][i];
			}
		}
	}
	
	rep(i, n) {
		int x = 2 * dist[i][0];
		int y = dist[i][0] + dist[i][1];
		cout << min(x, y) << endl;
	}
	return 0;
}