#include <bits/stdc++.h>

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

int n, m, x, y, c, viz[50005], d[50005];
vector<pair<int, int>> v[50005];
queue <int> q;
bool einq[50005];

int bellmanford(int x)
{
    q.push(x);
    viz[x] = 1;
    d[x] = 0;
    einq[x] = 1;
    while(q.empty() == 0) {
        x = q.front();
        q.pop();
        einq[x] = 0;
        for (int i = 0; i < v[x].size(); i++) {
            int y = v[x][i].first;
            if (d[y] > d[x] + v[x][i].second) {
                d[y] = d[x] + v[x][i].second;
                viz[y]++;
                if (viz[y] >= n - 1)
                    return 0;
                if (einq[y] == 0) {
                    q.push(y);
                    einq[y] = 1;
                }
            }
        }
    }
    return 1;
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y >> c;
        v[x].push_back({y, c});
    }
    for (int i = 1; i <= n; i++)
        d[i] = (1 << 30);
    if (bellmanford(1) == 0)
        fout << "Ciclu negativ!";
    else {
        for (int i = 2; i <= n; i++)
            fout << d[i] << " ";
    }
    return 0;
}