#include <vector>
#include <fstream>
#include <iostream>

#define DIM 50001
#define INF 1000000001
using namespace std;

int main() {
		
	int n, m;

	ifstream fin("dijkstra.in");
	ofstream fout("dijkstra.out");

	fin >> n >> m;
	
	vector < pair<int,int> > L[DIM];

	for (int i = 1; i <= m; i++) {
		int x, y, cost;
		fin >> x >> y >> cost;
		L[x].push_back(make_pair(y, cost));
	}

	int D[DIM];

	D[1] = 0;

	for( int i = 2; i <= n; i++){
		D[i] = INF;
	}

	int v[DIM];
	int nod;
	for (;;) {
		int minim = INF;

		for (int i = 1; i <= n; i++) {
			if (v[i] == 0 && D[i] < minim) {
				minim = D[i];
				nod = i;
			}
		}

		if (minim == INF) {
			break;
		}

		v[nod] = 1;

		for (int i = 0; i < L[nod].size(); i++) {

			int vecin = L[nod][i].first;
			int vcost = L[nod][i].second;

			if (D[vecin] < D[nod] + vcost)
				D[vecin] = D[nod] + vcost;

		}
	}

	for (int i = 2; i <= n; i++)
	{
		if (D[i] == INF)
			D[i] = 0;

		fout << D[i] << " ";
	}

	return 0;
}