#include <iostream>
#include <fstream>
#define nmax 50001
#define inf 1e9
#include <vector>
#include <queue>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
vector<pair<int,int> > v[nmax];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >h;
int d[nmax],n,m,a,b,c,nod;
bool w[nmax];
int main()
{
    int i,ok=1;

   f>>n>>m;
   for(i=1;i<=m;i++)
   {
       f>>a>>b>>c;
       v[a].push_back(make_pair(c,b));
   }
    for(i=1;i<=n;i++)
        d[i]=inf;
    d[1]=0;
   h.push(make_pair(0,1));
   while(!h.empty()&&ok)
   {
       nod=h.top().second;
       h.pop();
       for(i=0;i<v[nod].size()&&ok;i++)
       {
           if(d[nod]+v[nod][i].first<d[v[nod][i].second])
           {
                w[v[nod][i].second]++;
               d[v[nod][i].second]=d[nod]+v[nod][i].first;
               h.push(make_pair(d[v[nod][i].second],v[nod][i].second));
                if(w[v[nod][i].second]==n) ok=0;
           }
       }

   }
   if(!ok) g<<"Ciclu negativ!";
   else  for(i=2;i<=n;i++)
        {   if(d[i]==inf) g<<0<<" ";
            else g<<d[i]<<" ";}
    return 0;
}