#include <bits/stdc++.h>
int inf = (1<<30);
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m;
vector< pair<int, int> >g[50005];
vector <int> v;
queue <int> coada;
int d[50005];
int viz[50005];
int incoada[50005];
bool bellmanford(int s)
{
    for(int i=1;i<=n;i++)
    {
        viz[i]=0;
        incoada[i]=0;
        d[i]=inf;
    }
    d[s] = 0;
    coada.push(s);
    incoada[s] = 1;

    while(!coada.empty())
    {
        int nod_curent= coada.front();
        viz[nod_curent]++;
        if(viz[nod_curent] >= n)
            return false;
        coada.pop();
        incoada[nod_curent] = 0;

        for(int i=0;i<g[nod_curent].size();i++)
        {
            int vecin = g[nod_curent][i].first;
            int cost = g[nod_curent][i].second;
            if(d[nod_curent] + cost < d[vecin])
            {
                d[vecin] = d[nod_curent]+cost;
                if(!incoada[vecin])
                    coada.push(vecin);
            }
        }
    }
    return true;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
    if(bellmanford(1))
    {
        for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";
    }
    else
      fout<<"Ciclu negativ";
    return 0;
}