#include <bits/stdc++.h>

using namespace std;

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

int n, m, i, x, y, c;
int d[50005], ff[50005];

bitset<50005> f;

queue <int> q;

vector <pair<int, int> > L[50005];

void bellmanford (){
    int i, nod, vecin;
    for (i=1; i<=n; i++){
        d[i] = INT_MAX;
    }
    f[1] = 1;
    d[1] = 0;
    q.push(1);
    while (!q.empty()){
        nod = q.front();
        q.pop();
        for (i=0; i<L[nod].size(); i++){
            vecin = L[nod][i].first;
            ff[vecin]++;
            if (ff[vecin] == n){
                fout << "Ciclu negativ!";
                return ;
            }
            if (d[vecin] > d[nod] + L[nod][i].second){
                d[vecin] = d[nod] + L[nod][i].second;
                if (f[vecin] == 0){
                    f[vecin] = 1;
                    q.push(vecin);
                }
            }
        }
    }
}

int main(){
    fin >> n >> m;
    for (i=1; i<=m; i++){
        fin >> x >> y >> c;
        L[x].push_back({y, c});
    }
    bellmanford();
    for (i=2; i<=n; i++){
        fout << d[i] << " ";
    }
    return 0;
}
//recapitulare