#include <bits/stdc++.h>
using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
const int maxx=numeric_limits<int>::max() , nmax=5e4+5;

int n, m, d[nmax], viz[nmax];
vector< pair<int, int> > G[nmax];
vector <int> v;
queue <int> q;
bitset <nmax> qcheck;
bool BF(int start)
{
    for(int i=1;i<=n;i++)
    {
        d[i]=maxx;
    }
    d[start]=0;
    q.push(start);
    qcheck[start]=true;
    while(q.size())
    {
        int curent = q.front();
        q.pop();
        viz[curent]++;
        if(viz[curent] >= n)
        {
            return false;
        }
        qcheck[curent]=false;
        for(int i=0; i<G[curent].size();i++)
        {
            int vecin = G[curent][i].first;
            int cost = G[curent][i].second;
            if(d[curent] + cost < d[vecin])
            {
                d[vecin] = d[curent]+cost;
                if(!qcheck[vecin])
                {
                    q.push(vecin);
                }
            }
        }
    }
    return true;
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
    {
        int x, y, z;
        in>>x>>y>>z;
        G[x].push_back(make_pair(y, z));
    }
    if(!BF(1))
    {
        out<<"Ciclu negativ!";
        return 0;
    }
    for(int i=2;i<=n;i++)
    {
        out<<d[i]<<" ";
    }
}