#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define pb push_back

using namespace std;

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

const int MAXN = 5 * 1e4 + 10, INF = 0x3f3f3f3f;
int distances[MAXN], visited[MAXN], n, m;
vector<pair<int, int> > edges[MAXN];
queue<int> q;

void read() {
    int x, y, cost;
    fin >> n >> m;
    for (int i = 0; i < m; ++i) {
        fin >> x >> y >> cost;
        edges[x].pb({y, cost});
    }
}

void initialize() {
    for (int i = 1; i <= n; ++i)
        distances[i] = INF;
}

bool solve() {
    distances[1] = 0;
    q.push(1);
    ++visited[1];
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (auto &it: edges[node]) {
            if (distances[node] + it.second < distances[it.first]) {
                distances[it.first] = distances[node] + it.second;
                ++visited[it.first];
                if (visited[it.first] == n)
                    return false;
                q.push(it.first);
            }
        }
    }
    return true;
}

int main() {
    read();
    initialize();
    if (solve())
        for (int i = 2; i <= n; ++i)
            fout << distances[i] << ' ';
    else
        fout << "Ciclu negativ!\n";
    return 0;
}