#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>
using namespace std;

#define pb push_back

const char in[]="bellmanford.in";
const char out[]="bellmanford.out";

const int N = 50005;
const int INF = 0x3f3f3f3f;
vector<int> G[N], C[N];
queue<int> Q;

int cnt_Q[N], dist[N], n, m, x, y, cost, din_Q;
bool in_Q[N], ciclu_negativ;


int main()
{
	freopen(in,"r",stdin);
	freopen(out,"w",stdout);
	
	memset(dist, INF, sizeof(dist));
	
	scanf("%d %d", &n, &m);
	
	for(int i = 1 ; i <= m ; ++i)
	{
		scanf("%d %d %d", &x, &y, &cost);
		G[x].pb(y);
		C[x].pb(cost);
	}
	
	Q.push(1);
	dist[1] = 0;
	while(Q.size() && !ciclu_negativ)
	{
		din_Q = Q.front();
		/*x = G[din_Q].front();
		cost = C[din_Q].front();*/
		Q.pop();
		in_Q[din_Q] = false;
		for(int i = 0 ; i < G[din_Q].size(); ++i)
		if(dist[G[din_Q][i]] > dist[din_Q] + C[din_Q][i])
		{
			dist[G[din_Q][i]] = dist[din_Q] + C[din_Q][i];
			if(!in_Q[G[din_Q][i]])
				if(cnt_Q[G[din_Q][i]] > N) ciclu_negativ = true;
				else
				{
				Q.push(G[din_Q][i]);
				++cnt_Q[G[din_Q][i]];
				in_Q[G[din_Q][i]] = true;
			}
		}
		
	}
			
	if(ciclu_negativ)
	{
		printf("Ciclu negativ!");
		return 0;
	}
	
	for(int i = 2 ; i <= n ; ++i)
	printf("%d ", dist[i]);
	
	
	return 0;
}