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

using namespace std;

const int N = 50005;
const int inf = 1000000;

int n, m;

vector<pair<int, int> > vecini[N];
int distante[N];
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > Q;

void citire()
{
   scanf("%d %d", &n, &m);
   
   int tmp1, tmp2, tmp3;

   for(int i = 0; i < m; i++)
   {
		scanf("%d %d %d", &tmp1, &tmp2, &tmp3);

		tmp1--;
		tmp2--;

		vecini[tmp1].push_back(make_pair(tmp3, tmp2));
   }

   for(int i = 0; i < n; i++)
   {
		distante[i] = inf;
   }
}

void solve()
{
	Q.push(make_pair(0, 0));
	distante[0] = 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(distante[vecini[x][i].second] > distante[x] + vecini[x][i].first)	
			{
				distante[vecini[x][i].second] = distante[x] + vecini[x][i].first;
				Q.push(vecini[x][i]);
			}
		}
	}
}

void afisare()
{
	for(int i = 1; i < n; i++)
	{
		if(distante[i] == inf)
		{
			printf("0 ");
		}
		else
		{
			printf("%d ", distante[i]);
		}
	}
}

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

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

	return 0;
}