#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
const int NMAX = 50001 , infinit = (1<<30);
int dist[NMAX], folosit[NMAX],n;
vector < pair < int, int > > G[NMAX];
queue <int> coada;

int Bellman_Ford(int start) {
    for(int i=1; i<=n; i++)
        dist[i]=infinit;
    dist[start]=0;
    coada.push(start);
    while (!coada.empty()) {
        int nod=coada.front();
        coada.pop();
        folosit[nod]++;
        if(folosit[nod]>=n)
            return 1;
        for(unsigned i=0; i<G[nod].size(); i++) {
            int vecin = G[nod][i].first;
            int cost = G[nod][i].second;
            if(dist[nod]+cost<dist[vecin]) {
                dist[vecin]=dist[nod]+cost;
                coada.push(vecin);
            }
        }
    }
    return 0;
}

int main()
{
    int m,x,y,c;
    fin>>n>>m;
    for(int i=1; i<=m; i++) {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
    if(Bellman_Ford(1)) fout<<"Ciclu negativ!";
    else for(int i=2; i<=n; i++) {
        if (dist[i] && dist[i]!=infinit)
        fout<<dist[i]<<' ';
    }
    return 0;
}