#include <fstream>
#include <vector>
#include <queue>
using namespace std;
string file = "dijkstra";
ifstream cin(file + ".in");
ofstream cout(file + ".out");
struct graf {
	unsigned short nod;
	int cost;

	bool operator < (const graf& y) const
	{
		return cost > y.cost;
	}
};
struct ura
{
	const unsigned short nod;
	const int cost;
};
vector <ura> L[50001];


vector <int> d(50001, 1000000000);


void bfs()
{
	priority_queue <graf> Q;
	d[1] = 0;
	Q.push({ 1,0 });
	while (!Q.empty())
	{
		const unsigned short x = Q.top().nod,  distanta = Q.top().cost;
		if (distanta <= d[x])
		{
			for (const ura y : L[x])
			{
				if (d[y.nod] > d[x] + y.cost)
				{
					d[y.nod] = d[x] + y.cost;
					Q.push({ y.nod,d[y.nod] });
				}
			}
		}
		Q.pop();
	}
}
int main() {
	unsigned short n, x, y, z;
	int m;
	cin >> n >> m;
	while (cin >> x >> y >> z)
	{
		L[x].push_back({ y,z });
	}
	bfs();
	for (int i = 2; i <= n; i++)
		cout << (d[i] == 1000000000 ? 0 : d[i]) << ' ';
}