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

using namespace std;

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

#define limn 50010
#define inf 2e9
int n,m;
vector <pair<int, int>> G[limn];
queue <int> q;
int viz[limn], path[limn];

int main()
{
    int x,y,c,nod,cost;
    fin>>n>>m;
    while(m--)
    {
        fin>>x>>y>>c;
        G[x].push_back({y,c});
    }
    for(int i=1; i<=n; i++) path[i] = inf;

    path[1] = 0;
    q.push(1);
    while (!q.empty())
    {
        nod = q.front();
        q.pop();
        viz[nod]++;
        if (viz[nod] > n)
        {
            fout<<"Ciclu negativ!";
            return 0;
        }
        for (auto it:G[nod])
            if (!viz[it.first] && path[it.first] > path[nod] + it.second)
            {
                path[it.first] = path[nod] + it.second;
                q.push(it.first);
            }
    }

    for (int i=2; i<=n; i++)
      fout<<path[i]<<' ';


    fin.close();
    fout.close();
    return 0;
}