#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
vector< pair<int,int> >L[50010];
queue<int>c;
int n,m,i,j,p,u,a,b,q,v[50010],x[50010];
FILE *f,*g;
int main(){
    f=fopen("bellmanford.in","r");
    g=fopen("bellmanford.out","w");
    fscanf(f,"%d%d",&n,&m);
    for(i=1;i<=m;i++){
       fscanf(f,"%d%d%d",&a,&b,&q);
       L[a].push_back(make_pair(b,q));
    }
    for(i=2;i<=n;i++){
        v[i]=2000000000;
    }
    c.push(1);
    while(c.size()!=0){
        a=c.front();
        x[a]++;
        if(x[a]==n){
            fprintf(g,"Ciclu negativ!");
            return 0;
        }
        else{
            for(i=0;i<L[a].size();i++){
                if(v[ L[a][i].first ]>v[a]+L[a][i].second){
                    v[ L[a][i].first ]=v[a]+L[a][i].second;
                    c.push(L[a][i].first);
                }
            }
        }
        c.pop();
    }
    for(i=2;i<=n;i++){
        fprintf(g,"%d ",v[i]);
    }



    fclose(f);
    fclose(g);
    return 0;
}