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

#define NMAX 50000

using namespace std;

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

const int INF = 2e9;

int n, m;
int d[NMAX + 1];
int cnt[NMAX + 1];
bool inQ[NMAX + 1];
vector < pair < int, int > > v[NMAX + 1];

bool Bellman_Ford(int s) {
    for (int i = 1; i <= n; i++)
        d[i] = INF;
    d[s] = 0;
    queue < int > q;
    q.push(s);
    inQ[s] = true;
    cnt[s]++;
    while (!q.empty()) {
        int nc = q.front();
        q.pop();
        inQ[nc] = false;
        for (int i = 0; i < v[nc].size(); i++) {
            int nv = v[nc][i].second;
            int cst = v[nc][i].first;
            if (d[nc] + cst < d[nv]) {
                d[nv] = d[nc] + cst;
                if (!inQ[nv]) {
                    if(cnt[nv] > n)
                        return false;
                    else{
                        q.push(nv);
                        inQ[nv] = true;
                        cnt[nv]++;
                    }
                }
            }
        }
    }
    return true;
}

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