#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#define INF 1e9
#define pb push_back
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n, m, x, y, c, M[105][105],cost[50005],p,mini,poz,uz[105],nr[50005];
vector <pair<int, int> > L[50005];
queue <int> q;
void dijkstra()
{
	int i;
	for (i = 1; i <= n; i++) cost[i] = INF;
	cost[p] = 0;
	uz[p] = 1;
	for (i = 0; i < L[p].size(); i++)
		cost[L[p][i].first] = L[p][i].second;
	for(int j=1;j<n;j++)
	{ 
		mini = INF;
		poz = 0;
		for(i=1;i<=n;i++)
			if(mini>cost[i]&&!uz[i])
			{
				mini = cost[i];
				poz = i;
			}
		uz[poz] = 1;
		for (i = 0; i < L[poz].size(); i++)
			if (!uz[L[poz][i].first])
				cost[L[poz][i].first] = min(cost[L[poz][i].first], cost[poz] + L[poz][i].second);
	}
	for(i=1;i<=n;i++)
	{
		if (cost[i] == INF) fout << "-1 ";
		else fout << cost[i] << ' ';
	}
}
void roy_floyd()
{
	int i, j, k;
	for (k = 1; k <= n; k++)
		for (i = 1; i <= n; i++)
			for (j = 1; j <= n; j++)
				if (M[i][j] > M[i][k] + M[k][j])
					M[i][j] = M[i][k] + M[k][j];
	for(i=1;i<=n;i++)
	{
		for (j = 1;j<=n;j++)
		{
			if (M[i][j] == INF) fout << 0 << ' ';
			else fout << M[i][j] << ' ';
		}
		fout << '\n';
	}
}
void bf()
{
	int i;
	for (i = 2; i <= n; i++)
		cost[i] = INF;
	q.push(1);
	nr[1]++;
	while (!q.empty())
	{
		int aux = q.front();
		q.pop();
		for(i=0;i<L[aux].size();i++)
			if(cost[L[aux][i].first]>cost[aux]+L[aux][i].second)
			{
				cost[L[aux][i].first] = cost[aux] + L[aux][i].second;
				q.push(L[aux][i].first);
				nr[L[aux][i].first]++;
				if (nr[L[aux][i].first] == n) 
				{
					fout << "Ciclu negativ!";
					return;
				}
			}
	}
	for (i = 2; i <= n; i++)
		fout << cost[i] << ' ';
}
int main()
{
	int i, j;
	fin >> n >>m;
	for(i=1;i<=m;i++)
	{
		fin >> x >> y >> c;
		L[x].pb(make_pair(y, c));
	}
	bf();
	return 0;
}