#include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>
#include <list>
#include <queue>
#include <limits>

using namespace std;
typedef list<pair<int, int> > adiac;
typedef pair<int, int> tupl;
#define NMAX 50001
#define M 250001
#define Inf 99999

int n, m;
vector<list<pair<int,int> > > l(NMAX);
vector<int> dist(NMAX);

class Comp {
public:
	bool operator()(tupl p1, tupl p2){
		return p1.second > p2.second;
	}
};

void dijkstra() {
	priority_queue<tupl, vector<tupl>, Comp> Q;
	fill(dist.begin(), dist.end(), Inf);
	dist[1] = 0;
	Q.push(tupl(1, 0));
	while (!Q.empty()) {
		tupl u = Q.top(); Q.pop();
		for (auto &n : l[u.first]) {
			if (dist[n.first] > u.second + n.second) {
				dist[n.first] = u.second + n.second;
				Q.push(tupl(n.first, dist[n.first]));
			}
		}
	}
}

void write() {
	for (int i = 2; i <= n; i++) {
		printf("%d ", (dist[i]==Inf)?0:dist[i]);
	}
	printf("\n");
	fclose(stdout);
}

int main() {
	freopen("dijkstra.in", "r", stdin);
	freopen("dijkstra.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for (int i = 0; i <= m; i++) {
		int src, dst, cost;
		scanf("%d%d%d", &src, &dst, &cost);
		tupl pr(dst, cost);
		l[src].push_back(pr);
	}
	dijkstra();
	write();
}