#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

const int MAXN = 50005;
const int INF = 0x3f3f3f3f;

bool InQueue[MAXN];
queue<int> Q;
vector< pair<int, int> > G[MAXN];
int Dmin[MAXN];
int N, M;

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

	memset(Dmin, INF, sizeof(Dmin));
	memset(InQueue, false, sizeof(InQueue));

	fin >> N >> M;
	for (int i = 0; i < M; ++i) {
		int a, b, c;
		fin >> a >> b >> c;
		G[a].push_back(make_pair(b, c));
	}

	Dmin[1] = 0;
	Q.push(1);
	InQueue[1] = true;

	while (!Q.empty()) {
		int nod = Q.front();
		Q.pop();
		InQueue[nod] = false;

		for (vector< pair<int, int> >::iterator it = G[nod].begin(); it != G[nod].end(); ++it)
			if (Dmin[nod] + it->second < Dmin[it->first]) {
				Dmin[it->first] = Dmin[nod] + it->second;
				if (!InQueue[it->first]) {
					Q.push(it->first);
					InQueue[it->first] = true;
				}
			}
	}

	for (int i = 2; i <= N; ++i)
		fout << (Dmin[i] < INF ? Dmin[i] : 0) << " ";
}