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

#define pb push_back
#define mp make_pair

#define MAX 50001
#define INF 0x3f3f3f3f

using namespace std;

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

vector < pair < int , int > > G[MAX] ;
vector < pair < int , int > >::iterator j;
int  USED[MAX] ;
int  D[MAX];
int Aparitii[MAX];
queue < int > Q;

int n,m,x,y,z,start;

bool bellman_ford( int i )
{
    memset( D , INF , sizeof D);
    D[i] = 0;
    USED[i] = true;
    Q.push(i);
    Aparitii[i] = 1;
    int nod;

    while(!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        USED[nod] = false;
        for ( j = G[nod].begin(); j != G[nod].end(); j++ )
        {
            if (  D[ (*j).first ] > D[nod] + (*j).second )
            {
                D[ (*j).first ] = D[nod] + (*j).second;
                if( !USED[ (*j).first ] )
                {
                    Q.push( (*j).first);
                    USED[ (*j).first ] = true;
                    Aparitii[ (*j).first ]++;
                    if ( Aparitii [ (*j).first ] > n )
                    {
                        g << "Ciclu negativ!";
                        return false;
                    }
                }
            }
        }
    }
    return true;
}

int main()
{
    f >> n >> m;

    for ( ; m-- ;  )
    {
        f >> x >> y >> z;
        G[x].pb(mp (y,z) );
    }

    start = 1;

    if( bellman_ford(start ))
        for (int i = 2; i <= n ; ++i )
            g << D[i] << " " ;


    return 0;
}