#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "bellmanford"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		//freopen("test.out","w",stdout);
	}
}

#define MAX  50001
#define INF 0xffffff

int n,dist[MAX];
vector<pair<int,int> >g[MAX];
set<int>s1,s2;

void bellmanford()
{
	int x,y,c;
	for(int i=1;i<=n;i++)dist[i]=INF;
	dist[1] = 0;
	s1.insert(1);
	for(int i=1;i<=n;i++)
	{
		while(s1.size()>0)
		{
			x = *s1.begin();
			s1.erase(s1.begin());
			for(int i=0;i<g[x].size();i++)
			{
				y = g[x][i].first;
				c = g[x][i].second;
				if(dist[y] > dist[x] + c)
				{
					dist[y] = dist[x] + c;
					s2.insert(y);
				}
			}
		}
		swap(s1,s2);
	}
	if(s1.size()>0)printf("Ciclu negativ!"); else
		for(int i=2;i<=n;i++)printf("%d ",dist[i]);
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
	int m,x,y,c;
		scanf("%d %d",&n,&m);
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d %d",&x,&y,&c);
			g[x].push_back(make_pair(y,c));
		}
	bellmanford();
	return 0;
}