#include <bits/stdc++.h>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
#define cin f
#define cout g
const int Max = 1e5 + 1;

int n, m;
int d[Max], parent[Max];
vector<pair<int, int>> adj[Max];

void dijkstra(int s)
{	
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

	for(int i = 1; i <= n; i ++)
	{
		d[i] = INT_MAX;
		// parent[i] = -1;
	}
	d[s] = 0;
	pq.push({0, s});

	while(! pq.empty())
	{
		int v = pq.top().second;
		int v_w = pq.top().first;
		pq.pop();

		if(d[v] != v_w)
			continue;

		if(d[v] == INT_MAX)
			return;

		for(auto it : adj[v])
		{
			int to = it.first;
			int to_w = it.second;

			if(d[v] + to_w < d[to])
			{
				d[to] = d[v] + to_w;
				// parent[to] = v;
				pq.push({d[to], to});
			}
		}
	}
}

int main()
{
	cin >> n >> m;
	for(int i = 1; i <= m; i ++)
	{
		int x, y, w;
		cin >> x >> y >> w;
		adj[x].push_back({y, w});
	}

	dijkstra(1);

	for(int i = 2; i <= n; i ++)
	{
		if(d[i] == INT_MAX)
			d[i] = 0;
		cout<<d[i]<<' ';
	}

	return 0;

}