#include <stdio.h>

#define INF 50000010
#define mm 250010
#define nm 50010

long long n, m, i, j;
long long a, b, c;
long long Ms[nm], Md[nm], Mc[nm];
long long d[nm];




void read()

{
	scanf("%lld %lld ", &n, &m);
	for (i=1; i<=m; ++i)
	{
		scanf("%lld %lld %lld", &a, &b, &c);
		//v[a][++v[a][0]] = b;
		//u[a][v[a][0]] = c;
		Ms[i] = a;
		Md[i] = b;
		Mc[i] = c;
	}
	d[1] = 0;
	for (i=2; i<=n; ++i)
		d[i] = INF;

}


void solve()

{
	for (i=1; i<=n; ++i)
	{
		for (j=1; j<=m; ++j)
		{
			a = Ms[i];
			b = Md[i];
			c = Mc[i];
			if (d[b] > (d[a] + c))
				d[b] = d[a] + c;
		}
	}
}


void write()

{
	for (i=2; i<=n; ++i)
	{
		if (d[i] == INF)
			d[i] = 0;
		printf("%lld ", d[i]);
	}
	printf("\n");
}


int main()

{
	freopen("dijkstra.in", "r", stdin);
	freopen("dijkstra.out","w",stdout);

	read();
	solve();
	write();

	fclose(stdin);
	fclose(stdout);

	return 0;
}