#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf LONG_LONG_MAX

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

struct Edge
{
    ll u, v, weight;

    Edge(ll u, ll v, ll weight) : u(u), v(v), weight(weight)
    {
    }

    bool operator<(const Edge &other)
    {
        return weight < other.weight;
    }
};

ll n, m, s;
vector<ll> dist;
vector<Edge> edge_list;

void read()
{
    fin >> n >> m;
    dist.assign(n + 1, inf);

    for (ll i = 0; i < m; i++)
    {
        ll x, y, c;
        fin >> x >> y >> c;
        edge_list.push_back(Edge(x, y, c));
    }
}

void bellmanford()
{
    dist[1] = 0;
    for (ll i = 1; i <= n - 1; i++)
    {
        for (auto &e : edge_list)
        {
            if (dist[e.u] != inf && dist[e.u] + e.weight < dist[e.v])
            {
                dist[e.v] = dist[e.u] + e.weight;
            }
        }
    }
}

bool neg_cycle()
{
    for (auto &e : edge_list)
        if (dist[e.u] != inf && dist[e.v] > dist[e.u] + e.weight)
            return 1;
    return 0;
}

int main()
{
    read();
    bellmanford();

    if (neg_cycle())
        fout << "Ciclu negativ!\n";
    else
    {
        for (ll i = 2; i <= n; i++)
            fout << dist[i] << ' ';
    }
    return 0;
}