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

using namespace std;

ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
vector <int> graph[50005];
vector <int> graphC[50005];
priority_queue< pair<int,int> > myheap;
int dist[50005];
int viz[50005];
int N,M,x,y,c,i,k,index;
int esteincoada[50005];

#define max_size 2745636
bool ford(int s)
{
    for(int i=1; i<=N; i++)
    {
        esteincoada[i]=0;
    }
    esteincoada[s] = 1;



    for(i=1; i<=N; i++)
    {
        if(i==1)
            dist[i]=0;
        else
            dist[i]=max_size;

        myheap.push(make_pair(-dist[i],i));
    }

    while(!myheap.empty())
    {
        pair<int,int>p=myheap.top();
        index=p.second;
        myheap.pop();
        if(viz[index]==1);
        else
        {
            viz[index]++;
            if(viz[index] >= N)
                return false;
            esteincoada[index] = 0;

            int lim=graph[index].size();
            for(k=0; k<lim; k++)
            {
                int vecin=graph[index][k];
                if(dist[vecin]>(dist[index]+graphC[index][k]))
                {
                    dist[vecin]=dist[index]+graphC[index][k];
                    if(!esteincoada[vecin])
                        myheap.push(make_pair(-dist[vecin],vecin));
                }

            }
        }

    }
    return true;
}

int main()
{
    f>>N>>M;
    for(i = 0; i < M; i++)
    {
        f>>x>>y>>c;
        graph[x].push_back(y);
        graphC[x].push_back(c);
    }

    if(ford(1))
    {
        for(int i=2;i<=N;i++)
            fout<<dist[i]<<" ";
    }
    else
      fout<<"Ciclu negativ!";

    return 0;
}