#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

#define nmax 50001
long n, m;
vector < pair<long, int> > v[nmax];
queue <long> Q;
long d[nmax];

inline void citire()
{
	long x, y, c;
	freopen("dijkstra.in","r",stdin); scanf("%ld %ld", &n, &m);
	for(long i=1; i<=n; i++)
	{
		scanf("%ld %ld %d", &x, &y, &c);
		v[x].push_back( make_pair(y, c) );

	}
}

inline void afisare()
{
	freopen("dijkstra.out","w",stdout);
	for(long i=2; i<=n; i++)
		printf("%ld ", d[i]);
}

void bellman_ford()
{
	long nod, next;
	Q.push(1);
	while(!Q.empty())
	{
		nod = Q.front(); Q.pop();
		for(long i=0; i<v[nod].size(); i++)
			if(d[nod]+v[nod][i].second < d[ v[nod][i].first ] || d[v[nod][i].first]==0 )
			{
				d[ v[nod][i].first ] = d[nod] + v[nod][i].second;
				Q.push(v[nod][i].first);
			}
	}
}

int main()
{
	citire();
	bellman_ford();
	afisare();
	return 0;
}