#include <bits/stdc++.h>
using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
const int N = 50005, M = 1999999999;
int d[N], apare[N];
bool inQueue[N];
vector < pair< int,int > > v[N];
queue <int> q;
bool bellman(int n){
    int sz, nbr, node, c;
    for(int i=2;i<=n;i++)
        d[i] = M;
    q.push(1);
    inQueue[1] = true;
    apare[1] = 1;
    while(!q.empty()){
        node = q.front();
        q.pop();
        inQueue[node] = false;
        sz = v[node].size();
        for(int i=0;i<sz;i++){
            nbr = v[node][i].first;
            c = v[node][i].second;
            if(d[nbr] > d[node] + c){
                d[nbr] = d[node] + c;
                if(inQueue[nbr] == false){
                    inQueue[nbr] = true;
                    if(apare[nbr] > n)
                        return false;
                    apare[nbr] ++;
                    q.push(nbr);
                }
            }
        }
    }
    return true;
}
int main()
{
    int n, m, z, y, x;
    in>>n>>m;
    for(int i=1;i<=m;i++){
        in>>x>>y>>z;
        v[x].push_back({y,z});
    }
    in.close();
    if(!bellman(n))
        out<<"Ciclu negativ!";
    else
        for(int i=2;i<=n;i++)
            out<<d[i]<<" ";
    out<<"\n";
    out.close();
    return 0;
}