#include<bits/stdc++.h>

#define INF 1e9

using namespace std;

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

int n, m;
int dist[50005], viz[50005], f[50005];
vector<pair<int, int>> g[50005];

int main(){
    in>>n>>m;
    for(int i=1; i<=m; i++){
        int x, y, c;
        in>>x>>y>>c;
        g[x].push_back({y, c});
    }
    for(int i=1; i<=n; i++){
        dist[i]=INF;
    }
    queue<int> q;
    q.push(1);
    dist[1]=0;
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        viz[nod]=0;
        for(auto el:g[nod]){
            int v=el.first, cost=el.second;
            if(dist[nod]+cost<dist[v]){
                dist[v]=dist[nod]+cost;
                if(!viz[v]){
                    if(f[v]>n){
                        out<<"Ciclu negativ!";
                        return 0;
                    }
                    q.push(v);
                    viz[v]=1;
                    f[v]++;
                }
            }
        }
    }
    for(int i=2; i<=n; i++){
        out<<dist[i]<<" ";
    }
    return 0;
}