#include <iostream>
#include <queue>
#include <fstream>
#include <vector>
#define nmax 50001
#define value first
#define node second
#define inf (1<<30)
using namespace std;

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

vector< pair<int, int> > v[nmax];
queue<int> q;

int n, m;
int best[nmax], prev[nmax], cycle[nmax];

void bellman_ford(){
    q.push(1);
    for(int i=2; i<=n; i++) best[i]= inf;
    while(!q.empty()){
        int cur= q.front();
        q.pop();
        for(int i=0; i<v[cur].size(); i++)
            if(best[v[cur][i].node]> best[cur]+ v[cur][i].value){
                best[v[cur][i].node]= best[cur]+v[cur][i].value;
                cycle[v[cur][i].node]++;
                prev[v[cur][i].node]= cur;
                q.push(v[cur][i].node);
                if(cycle[v[cur][i].node] > n-1){
                    fout << "Ciclu negativ!";
                    return;
                }
            }
        }
    for(int i=2; i<=n; i++)
        if(best[i]==inf)    fout << 0 << " ";
        else    fout << best[i] << " ";
}



int main(){
    int x, y, w;
    fin >> n >> m;
    for(int i=1; i<=m; i++){
        fin >> x >> y >> w;
        v[x].push_back(make_pair(w, y));
    }
    bellman_ford();
    return 0;
}