#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
#define NMAX 50005

ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

struct TNod {
    int dest, cost;
};
int n, m, cnt[NMAX], dist[NMAX];
vector <TNod> graf[NMAX];
queue <int> coada;

void BFS(int nod) {
    dist[1] = 0;
    coada.push(nod);
    while (!coada.empty()) {
        nod = coada.front();
        coada.pop();
        cnt[nod]++;
        if (cnt[nod] == n + 1) {
            cout<<"Ciclu negativ!";
            exit(0);
        }
        for (int i = 0; i < graf[nod].size(); i++) {
            if (dist[graf[nod][i].dest] > dist[nod] + graf[nod][i].cost) {
                dist[graf[nod][i].dest] = dist[nod] + graf[nod][i].cost;
                coada.push(graf[nod][i].dest);
            }
        }
    }
}

int main()
{
    cin>>n>>m;
    for (int i = 1; i <= m; i++) {
        int x, y, c;
        cin>>x>>y>>c;
        graf[x].push_back({y, c});
    }
    for (int i = 1; i <= n; i++) {
        dist[i] = INT_MAX;
    }
    BFS(1);
    for (int i = 2; i <= n; i++) {
        cout<<dist[i]<<" ";
    }
    return 0;
}