#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int D[50001], viz[50001];
queue<int>coada;
vector<pair<int, int>>G[50001];

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        int x, y, c;
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y, c));
    }
    for(int i=1; i<=n; ++i) D[i]=1e9;
    D[1]=0;
    coada.push(1);
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        ++viz[nod];
        if(viz[nod]>n)
        {
            fout<<"Ciclu negativ!\n";
            return 0;
        }
        for(auto it:G[nod])
        {
            if(D[it.first]>D[nod]+it.second)
            {
                D[it.first]=D[nod]+it.second;
                coada.push(it.first);
            }
        }
    }
    for(int i=2; i<=n; ++i) fout<<D[i]<<" ";
    return 0;
}