#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const ll INF = 1000000000000000000;

//経路復元なしDijkstra法
template<class T> 
vector<T> dijkstra(int start, T INF, const vector<vector<pair<int,T>>>& Hen){
	int N = Hen.size();
	vector<T> dist(N, INF);
	vector<bool> seen(N);
	dist[start] = 0;
	priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> que;
	que.emplace(0, start);

	while(que.size()) {
		int ver = que.top().second;
		T cost = que.top().first; que.pop();
		if(seen[ver])continue;
		seen[ver] = true;
		for(auto i : Hen[ver]) {
			if(dist[i.first] > cost + i.second) {
				dist[i.first] = cost + i.second;
				que.emplace(dist[i.first], i.first);
			}
		}
	}
	return dist;
}



int n, m;
int id(int v, int p) {
	return p * n + v;
}


int main()
{
	cin >> n >> m;
	vector<vector<pair<int,ll>>> hen(n * 2);
	for(int i = 0; i < m; i++) {
		int a, b, c; cin >> a >> b >> c; a--, b--;
		for(int j = 0; j < 2; j++) {
			hen[id(a,j)].push_back({id(b,j), c});
			hen[id(b,j)].push_back({id(a,j), c});
		}
		hen[id(a,0)].push_back({id(b, 1), 0});
		hen[id(b,0)].push_back({id(a, 1), 0});	
	}
	vector<ll> dist = dijkstra(0, INF, hen);


	for(int i = 0; i < n; i++) {
		cout << dist[i] + min(dist[i+n],dist[i]) << endl;
	}

}