#include <bits/stdc++.h>
#define Dim 50002
#define oo 1e9
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int N,M,D[Dim],T[Dim],R[Dim];
bool viz[Dim];

vector < pair<int,int> > V[Dim];

bool Bellman_Ford()
{
    queue < int > qu;
    bool there_queue[N+1]={0};
    for(int i=1;i<=N;i++) D[i]=oo,T[i]=0;
    T[1]=0,D[1]=0;

    qu.push(1);
    there_queue[1]=1;
    while(!qu.empty())
    {
        int nod=qu.front();
        qu.pop();
        there_queue[nod]=0;

        R[nod]++;
        if(R[nod]==N) return false;

        for(unsigned int i=0;i<V[nod].size();i++)
        {
            int vecin=V[nod][i].first;
            int cost=V[nod][i].second;

            if( D[vecin] > D[nod] + cost )
            {
                D[vecin]=D[nod]+cost;
                if(!there_queue[vecin])
                {
                    there_queue[vecin]=1;
                    T[vecin]=nod;
                    qu.push(vecin);
                }
            }
        }
    }
    return true;

}

int main()
{
    int a,b,c;
    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        f>>a>>b>>c;;
        V[a].push_back({b,c});
    }

    if(Bellman_Ford())
    for(int i=2;i<=N;i++)
    g<<D[i]<<' ';
    else g<<"Ciclu negativ!";

    return 0;
}