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

#define inf 200000000
#define N 500010
using namespace std;

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

vector < pair<int,int> > p[N];
queue <int> q;

bool a[N],cycle=false;

int n,m,i,j,from,to,cost,fr[N],dist[N],nod;

int main()
{
    f>>n>>m;
    while(m)
    {
        f>>from>>to>>cost;
        p[from].push_back(make_pair(to,cost));
        m--;
    }
    for(i=1;i<=n;i++)
    {
        dist[i]=inf;
    }
    dist[1]=0;
    q.push(1);
    while(!q.empty()&&cycle==false)
    {
        nod=q.front();
        q.pop();
        vector <pair <int,int> >::iterator it;
        for(it=p[nod].begin();it!=p[nod].end();it++)
        {
            to=it->first;
            cost=it->second;
            if(dist[to]>dist[nod]+cost)
            {
                dist[to]=dist[nod]+cost;
                if(a[to]==false)
                {
                    a[to]=true;
                    q.push(to);
                    fr[to]++;
                }
                else
                    fr[to]++;
                if(fr[to]>n)
                    cycle=true;
            }
        }

    }
    if(cycle==true)
        g<<"Ciclu negativ!";
    else
        for(i=2;i<=n;i++)
            g<<dist[i]<<' ';
    return 0;
}