#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <deque>

using namespace std;

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

#define nmax 50005
#define inf (1<<30)
#define ll long long

int n, m, dist[nmax], q[nmax], viz[nmax];
bool inCoada[nmax];
vector< pair<int,int> > gf[nmax];

void citeste(){
    f >> n >> m;
    int x, y, z;
    for(int i=1; i<=m; ++i){
        f >> x >> y >> z;
        gf[x].push_back( make_pair(y, z) );
    }
}

void rezolva(){
    q[0] = 1;
    int st = 1; int dr = 1;
    q[dr] = 1; inCoada[1] = 1;
    for(int i=2; i<=n; ++i) dist[i] = inf;
    for(; st<=dr; ){
        int nod = q[st]; ++st;
        inCoada[nod] = 0;// eu il scot acum deci sa stiu ca l-am scos; daca ii mai minimizez distanta sa il bag in coada pt ca il scot acum
        for(int i=0; i<gf[nod].size(); ++i){
            int vc = gf[nod][i].first;
            int cost = gf[nod][i].second;
            if ( dist[vc] > dist[nod] + cost){
                dist[vc] = dist[nod] + cost;
                ++viz[vc];// a fost minimizat de viz[vc] ori
                if (viz[vc] == n){// s-ar realizat un ciclu
                    g << "Ciclu negativ!" << "\n";
                    return;
                }else {// daca mai e in coada numai are rost sa il mai bag incaodata;
                    if (inCoada[vc] == 0){
                        q[++dr] = vc;
                    }
                }
            }
        }
    }
    for(int i=2; i<=n; ++i) g << dist[i] << " ";
}

int main(){
    citeste();
    rezolva();

    f.close();
    g.close();

    return 0;
}