#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int N, M;

#define inf 1000000001
#define MAX_N 50001

//int costMatrix[501][501] = { { inf } };

typedef struct nodeNDP {
	int node;
	int d;
	int parent;
} nodeNDP;

void readFile( int costMatrix[MAX_N][MAX_N], const char* filename )
{
	FILE* f = fopen( filename, "r" );
	if ( f == NULL ) {
		printf( "ERROR AT OPENING FILE\n" );
		return;
	}

	fscanf( f, "%d %d", &N, &M );

	for ( int i = 0; i < N; i++ ) {
		for ( int j = 0; j < N; j++ ) {
			if ( i == j ) {
				costMatrix[i][j] = 0;
				continue;
			}
			costMatrix[i][j] = inf;
		}
	}
	int A, B, C;
	for ( int i = 0; i < M; i++ ) {
		fscanf( f, "%d %d %d", &A, &B, &C );
		costMatrix[A - 1][B - 1] = C;
	}

	fclose( f );
}

nodeNDP* dijkstra( int costMatrix[MAX_N][MAX_N], int source )
{
	nodeNDP* NDP = (nodeNDP*)malloc( sizeof( nodeNDP ) * ( N + 1 ) );
	int visited[50000];
	for ( int i = 1; i <= N; i++ ) {
		NDP[i].node = i;
		NDP[i].d = inf;
		NDP[i].parent = -1;
		visited[i] = 0;
	}
	source--;
	NDP[source].d = 0;
	int count = 1;
	while ( count <= N - 1 ) {
		for ( int i = 0; i < N; i++ ) {
			if ( source != i && costMatrix[source][i] != inf && visited[i] == 0 ) {
				int distance = NDP[source].d + costMatrix[source][i];
				if ( distance < NDP[i].d ) {
					NDP[i].d = distance;
					NDP[i].parent = source;
				}
			}
		}
		visited[source] = 1;
		count++;
		int min = inf;
		for ( int i = 1; i <= N; i++ ) {
			if ( min > NDP[i].d && visited[i] == 0 ) {
				min = NDP[i].d;
				source = i;
			}
		}
	}
	return NDP;
}

int main()
{
	int costMatrix[MAX_N][MAX_N];

	readFile( costMatrix, "dijkstra.in" );
	nodeNDP* NDP = dijkstra( costMatrix, 1 );
	FILE* f = fopen( "dijkstra.out", "w" );
	for ( int i = 1; i < N; i++ ) {
		if ( NDP[i].d == inf ) {
			fprintf( f, "%d ", 0 );
		} else {
			fprintf( f, "%d ", NDP[i].d );
		}
	}

	free( NDP );
	fclose( f );
	return 0;
}