#include <bits/stdc++.h>
#define Nmax 50005
#define INF 2e9
using namespace std;

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

int N, M;
int dist[Nmax], upd[Nmax];
bool in[Nmax];
vector<pair<int, int> > G[Nmax];
queue<int> Q;
int main()
{
    fin >> N >> M;
    while (M--) {
        int x, y, c;
        fin >> x >> y >> c;
        G[x].push_back({y, c});
    }
    for (int i = 2; i <= N; ++i)
        dist[i] = INF;

    Q.push(1);
    while (!Q.empty()) {
        int node = Q.front();
        Q.pop();
        in[node] = 0;

        for (auto it: G[node]) {
            int nxt = it.first, len = it.second + dist[node];
            if (len < dist[nxt]) {
                dist[nxt] = len;
                upd[nxt]++;
                if (!in[nxt]) Q.push(nxt), in[nxt] = 1;
            }
            if (upd[nxt] == N) {
                fout << "Ciclu negativ!\n";
                return 0;
            }
        }
    }

      for (int i = 2; i <= N; ++i)
        fout << dist[i] << " ";

    return 0;
}