#include <fstream>
#include <vector>
#define dmax 2000000000
using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

int n, m, viz[50100], N[50100],c[500100], i , j, x, y, cost, p , u, D[50100];
vector < pair <int , int > > L[251000];
int main()
{
    fin >> n >> m;
    for(i = 1;i <= m; i ++){
         fin >> x >> y >> cost;
       L[x].push_back(make_pair(y, cost));
    }
    for(i=1;i<=n;i++){
        D[i]=dmax;
    }
    D[1] = 0;
    viz[1] = 1;
    p = 1; u = 1; c[1] = 1; viz[1] = 1;
    while(p <= u){
        viz[c[p]] = 1;
        for(i = 0; i < L[c[p]].size(); i ++)
        {
            if(D[L[c[p]][i].first] > D[c[p]] + L[c[p]][i].second){
                D[L[c[p]][i].first] = D[c[p]] + L[c[p]][i].second;
            if(viz[L[c[p]][i].first] == 0){
                u ++;
                c[u] = L[c[p]][i].first;
                 N[c[p]]++;
                    if (N[c[p]] == n) {
                        fout<<"Ciclu negativ!";
                        return 0;
                    }
                    viz[L[c[p]][i].first] = 1;
            }
            }
        }
        viz[c[p]] = 0;
        p++;
    }
    for(i = 2; i <= n; i ++)
        fout << D[i] << " ";
    return 0;
}