#include <fstream>
#include <vector>
#include <queue>
#include <cstdlib>
#define DMAX 50010
#define INF 500000000

using namespace std;

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

int n, m, nre[DMAX], d[DMAX], nod, vecin, cost;
bool in[DMAX];
vector <int> A[DMAX], C[DMAX];
queue <int> Q;

int main()
{
    int i, a, b, c;
    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> a >> b >> c;
        A[a].push_back(b);
        C[a].push_back(c);
    }
    for (i = 2; i <= n; i++)
        d[i] = INF;
    Q.push(1);
    in[1] = 1;
    nre[1] = 1;
    while (!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        in[nod] = 0;
        for (i = 0; i < A[nod].size(); i++)
        {
            vecin = A[nod][i];
            cost = C[nod][i];
            if (d[vecin] > d[nod] + cost)
            {
                d[vecin] = d[nod] + cost;
                if (!in[vecin])
                {
                    Q.push(vecin);
                    in[vecin] = 1;
                    nre[vecin]++;
                    if (nre[vecin] >= n)
                    {
                        fout << "Ciclu negativ!\n";
                        fout.close();
                        exit(0);
                    }
                }
            }
        }
    }
    for (i = 2; i <= n; i++)
        fout << d[i] << ' ';
    fout << '\n';
    fout.close();
    return 0;
}