#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
#define NMAX 50002

using namespace std;

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

int N, M, cost[NMAX];
vector <int> v[NMAX];
queue <int> q;

void ReadData ()
{
	fin >> N >> M;
	for (int i = 1, a, b, c; i <= M; ++i)
	{
		fin >> a >> b >> c;
		v[a].push_back (b);
		v[a].push_back (c);
	}
	for (int i = 2; i <= N; ++i)
		cost[i] = INF;
}

void Solve ()
{
	q.push (1);
	while (!q.empty ())
	{
		int x = q.front ();
		for (int i = 0; i < v[x].size (); i += 2)
		{
			if (cost[v[x][i]] > cost[x] + v[x][i + 1])
			{
				q.push (v[x][i]);
				cost[v[x][i]] = cost[x] + v[x][i + 1];
			}
		}
		q.pop ();
	}
}

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

int main ()
{
	ReadData ();
	Solve ();
	WriteData ();
}