#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
vector <pair<int,int> > A[50001];
queue <int> Q;

int n,m;
int D[50001],P[50001],N[50001];
bool viz[50001];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        A[a].push_back({b,c});
    }
    for(int i=2;i<=n;i++)
        D[i]=2000000000;
    viz[1]=1;
    Q.push(1);
    while(!Q.empty())
    {
        int u=Q.front();
        viz[u]=0;
        Q.pop();
        for(auto it:A[u])
        {
            int v=it.first;
            int cost=it.second;
            if(D[v]>D[u]+cost)
            {
                D[v]=D[u]+cost;
                if(!viz[v])
                {
                    N[v]++;
                    if(N[v]==n)
                    {
                        fout<<"Ciclu Negativ!";
                        return 0;
                    }
                    viz[v]=1;
                    Q.push(v);
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(D[i]!=2000000000)
        fout<<D[i]<<" ";
        else
            fout<<0<<" ";
    }
    return 0;
}