#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf (1<<30)
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,m,x,y,c,start,finish,cost;
int cycle[50005],v[50005];
vector<pair <int,int> >vecini[50005];
queue<int> q;

bool BellmanFord(int x)
{
    q.push(x);
    while(!q.empty())
    {
        start=q.front(); q.pop();
        for(int i=0;i<vecini[start].size();++i)
        {
            finish=vecini[start][i].first;
            cost=vecini[start][i].second+v[start];
            if(cost<v[finish])
            {
                v[finish]=cost;
                cycle[finish]++;
                q.push(finish);
            }
            if(cycle[finish]==2*n) return 0;
        }
    }
    return 1;
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>c;
        vecini[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;++i) v[i]=inf;
    if(BellmanFord(1)==0) g<<"Ciclu negativ!";
    else for(int i=2;i<=n;++i) g<<v[i]<<' ';
    return 0;
}