#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

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

#define nmax 50100
#define f first
#define s second
#define mp make_pair
#define inf 1000000000

priority_queue < pair <int,int>, vector < pair<int,int> >, greater < pair<int,int> > > h;
vector < pair <int,int > >v[nmax];
vector < pair <int,pair<int,int> > >edges;
int d[nmax];
int viz[nmax];
int n,m,i,a,b,cost,nod;

int main()
{
    fin>>n>>m;
    for(i=1; i<=m; ++i)
    {
        fin>>a>>b>>cost;
        v[a].push_back(mp(cost,b));
        edges.push_back(mp(a,mp(b,cost)));
    }
    for(i=2; i<=n; ++i)
        d[i]=inf;
    h.push(mp(0,1));
    long long pasmax=1LL*n*m;
    long long pas=0;
    while(!h.empty() && pas<pasmax)
    {
        nod=h.top().s;
        ++pas;
        h.pop();
      //  viz[nod]=0;
        for(i=0; i<v[nod].size(); ++i)
        {
            if(d[v[nod][i].s]>v[nod][i].f+d[nod])
            {
                d[v[nod][i].s]=v[nod][i].f+d[nod];
        //        if(viz[v[nod][i].s]==0)
          //      {
            //        viz[v[nod][i].s]=1;
                    h.push(mp(d[v[nod][i].s],v[nod][i].s));
              //  }
            }
        }
    }
    for(i=0; i<m; ++i)
        if(d[edges[i].f]+edges[i].s.s<d[edges[i].s.f])
        {
            fout<<"Ciclu negativ!";
            return 0;
        }
    for(i=2; i<=n; ++i)
        fout<<d[i]<<' ';
}