#include<stdio.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<string.h>
#define x first
#define mp make_pair
#define y second
using namespace std;
FILE*in=fopen("bellmanford.in","r");
FILE*out=fopen("bellmanford.out","w");
int noduri,muchii,dist[50001],calcul[50001];
bool exista[50001];
queue < int > q;
vector<pair<int,int> > a[50001];
int main()
{
    fscanf(in,"%d%d",&noduri,&muchii);
    for(int i=1;i<=muchii;++i)
    {
        int data1,data2,data3;
        fscanf(in,"%d%d%d",&data1,&data2,&data3);
        a[data1].push_back(mp(data2,data3));
    }
    memset(dist,1061109567,sizeof(dist));
    q.push(1);
    dist[1]=0;
    while(!q.empty())
    {
        int curent=q.front();
        exista[curent]=false;
        q.pop();
        for(int i=0;i<(int)a[curent].size();++i)
        {
            if(dist[a[curent][i].x]>dist[curent]+a[curent][i].y)
            {
                dist[a[curent][i].x]=dist[curent]+a[curent][i].y;
                if(!exista[a[curent][i].x])
                {
                    exista[a[curent][i].x]=true;
                    if(++calcul[a[curent][i].x]>=noduri)
                    {
                        fprintf(out,"Ciclu negativ!");
                        fclose(in);
                        fclose(out);
                        return 0;
                    }
                    q.push(a[curent][i].x);
                }
            }
        }
    }
    for(int i=2;i<=noduri;++i)
        fprintf(out,"%d ",dist[i]);
    fprintf(out,"\n"); // pt hareza
fclose(in);
fclose(out);
return 0;
}