#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

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

const int N = 50001;
const int INF = 100000;

queue<int> q;
vector<int> a[N],c[N];

int n,m,d[N],w[N];

void cit(){
    int i,j,k,l;
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>j>>k>>l;
        a[j].push_back(k);
        c[j].push_back(l);
    }
}

void bellman_ford(){
    int i,j,x;
    for(i=2;i<=n;i++)
        d[i]=INF;
    q.push(1);
    while(!q.empty()){
        x=q.front();
        q.pop();
        w[x]++;
        if(w[x]>n){
            fout<<"Ciclu negativ!";
            return ;
        }
        for(j=0;j<a[x].size();j++)
        if(d[x]+c[x][j]<d[a[x][j]]){
            d[a[x][j]]=d[x]+c[x][j];
            q.push(a[x][j]);
        }
    }
    for(i=2;i<=n;i++)
        fout<<d[i]<<" ";
}

int main()
{
    cit();
    bellman_ford();
    return 0;
}