#include <fstream>
#include <queue>
#include <algorithm>
#define pii pair <int,int>
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define NMAX 50005
#define INF 1000000000
using namespace std;
int n,m,D[NMAX];
vector <pii> A[NMAX];
queue <int> Q;
pii nod;
bool B[NMAX];
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
void read()
{
	in>>n>>m;
	int i,x,y,z;
	for (i=1; i<=m; i++)
	{
		in>>x>>y>>z;
		A[x].pb(mp(y,z));
	}
}
void init()
{
	int i;
	for (i=2; i<=n; i++)
		D[i]=INF;
	Q.push(1); B[1]=1;
}
void solve()
{
	int i,nod,vec,cost;
	init();
	while (!Q.empty())
	{
		nod=Q.front();
		Q.pop(); B[nod]=0;
		for (i=0; i<A[nod].size(); i++)
		{
			vec=A[nod][i].x;  cost=A[nod][i].y;
			if (D[vec]>D[nod]+cost)
			{
				D[vec]=D[nod]+cost;
				if (!B[vec])
					Q.push(vec),B[vec]=1;
			}
		}
	}
	
	for (i=2; i<=n; i++)
		out<<D[i]<<' ';
	out<<'\n';
}
int main()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	read();
	solve();
	return 0;
}