#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int N = 50005;
const int inf = 0x3f3f3f3f;

int n, m;
vector<vector<pair<int, int> > > vecini;
priority_queue<pair<int, int>, 	vector<pair<int, int> >, greater<pair<int, int> > > Q;
vector<int> viz;

void citire()
{
	scanf("%d %d", &n, &m);

	viz.resize(n + 3);
	vecini.resize(n + 3);

	int tmp1, tmp2, tmp3;

	for(int i = 1; i <= m; i++)
	{
		scanf("%d %d %d", &tmp1, &tmp2, &tmp3);
		
		vecini[tmp1].push_back(make_pair(tmp3, tmp2));
		viz[i] = inf;
	}
}

void solve()
{
	Q.push(make_pair(0, 1));
	viz[1] = 0;

	while(Q.empty() == false)
	{
		int x = Q.top().second;
		Q.pop();

		int l = vecini[x].size();

		for(int i = 0; i < l; i++)
		{
			if(viz[vecini[x][i].second] == inf || viz[vecini[x][i].second] > viz[x] + vecini[x][i].first)
			{
				viz[vecini[x][i].second] = viz[x] + vecini[x][i].first;
				Q.push(vecini[x][i]);
			}
		}
	}
}

void afisare()
{
	for(int i = 2; i <= n; i++)
	{
		if(viz[i] == inf)
		{
			printf("0 ");
			continue;
		}

		printf("%d ", viz[i]);
	}
}

int main()
{
	freopen("dijkstra.in", "r", stdin);
	freopen("dijkstra.out", "w", stdout);

	citire();
	solve();
	afisare();

	return 0;
}