#include<fstream>
#include<queue>
#include<vector>
#include<iostream>
using namespace std;

#define NMAX 50001

queue<int> Q;
vector<int> d;
vector<pair<int, int> > g[NMAX];
int n, m, minim;

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

bool BF();

int main()
{
	int x, y, c;
	fin >> n >> m;
	d.resize(n + 1, 0x3f3f3f3f);
	for (int i = 1; i <= m; ++i)
	{
		fin >> x >> y >> c;
		if (c < minim)
			minim = c;
		g[x].push_back(make_pair(c, y));
	}
	BF();
	if (BF() == false)
		fout << "Ciclu negativ!";
	else
	for (int i = 2; i <= n; ++i)
		fout << d[i] << ' ';
	fin.close();
	fout.close();
	return 0;
}

bool BF()
{
	int x;
	d[1] = 0;
	Q.push(1);
	while (!Q.empty())
	{
		x = Q.front();
		Q.pop();
		for (vector<pair<int, int> >::iterator it = g[x].begin(); it != g[x].end(); ++it)
		{
			//cout << it->second << ' ' << it->first << '\n';
			if (d[it->second] > d[x] + it->first)
			{
				d[it->second] = d[x] + it->first;
				Q.push(it->second);
			}
		}
		if (d[x] < minim)
			return false;
	}
	return true;
}