#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <array>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
void solve()
{
	int N,M;
	cin >> N >> M;
	vector<vector<pair<int,int>>> G(N);
	for(int i = 0;i < M;i++)
	{
		int u,v,w;
		cin >> u >> v >> w;
		u--; v--;
		G[u].push_back(make_pair(v,w));
		G[v].push_back(make_pair(u,w));
	}
	vector<vector<long long>> dp(N,vector<long long>(2,(long long)1e18));
	dp[0][0] = 0;
	dp[0][1] = 0;
	priority_queue<pair<long long,pair<int,int>>> Q;
	Q.push(make_pair(-0ll,make_pair(0,0)));
	while(!Q.empty())
	{
		long long cur = -Q.top().first;
		const auto [u,s] = Q.top().second;
		Q.pop();
		if(dp[u][s] < cur) continue;
		for(const auto &[v,w] : G[u])
		{
			if(dp[v][s] > dp[u][s] + w)
			{
				dp[v][s] = dp[u][s] + w;
				Q.push(make_pair(-dp[v][s],make_pair(v,s)));
			}

			if(!s)
			{
				if(dp[v][1] > dp[u][s])
				{
					dp[v][1] = dp[u][s];
					Q.push(make_pair(-dp[v][1],make_pair(v,1)));
				}
			}
		}
	}
	for(int i = 0;i < N;i++) cout << dp[i][0] + dp[i][1] << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}