#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

#define NMAX 50005
#define INF 1e9

vector<pair<int, int>> G[NMAX];
priority_queue<pair<int, int>> PQ;
int dist[NMAX];
int viz[NMAX];

void bellmanford(int start, int n) {
    for (int i = 1; i <= n; ++i) {
        dist[i] = INF;
    }

    dist[start] = 0;
    PQ.push({0, start});
    while (PQ.size()) {
        int nod = PQ.top().second;
        PQ.pop();

        viz[nod]++;
        if (viz[nod] > n) {
            fout << "Ciclu negativ!";
            exit(0);
        }

        for (auto it : G[nod]) {
            if (dist[it.first] > dist[nod] + it.second) {
                dist[it.first] = dist[nod] + it.second;
                PQ.push({-dist[it.first], it.first});
            }
        }
    }
}

int main() {
    int n, m;
    fin >> n >> m;
    while (m--) {
        int a, b, c;
        fin >> a >> b >> c;

        G[a].push_back({b, c});
    }

    bellmanford(1, n);

    for (int i = 2; i <= n; ++i) {
        fout << dist[i] << ' ';
    }
    return 0;
}