#include <stdio.h>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

const int NMAX = 50000;
const int MMAX =  250000;
const int inf = 1000000000;
struct edge
{
    long a, b, c;
} e[MMAX + 1];
long n, m, i, j, k, left, right, cost[NMAX + 1], f[NMAX + 1];
vector <long> v[NMAX + 1];
vector <pair<long, long> > h;
void init()
{
    long i;
    cost[ 1 ] = 0;
    for(i = 2; i <= n; i++)
        cost[i] = inf;
    h.push_back(make_pair(0 , 1));
    make_heap(h.begin(), h.end());
}
void solve()
{
    pair<long, long> per;
    long i, j, vertex, poz;
    long long pas = 0;
    while(h.size() && pas <= 1LL * n * m)
    {
        pas ++;
        pop_heap(h.begin() , h.end());
        per = h.back();
        h.pop_back();
        vertex = per.second;
        f[vertex]=0;
        for(j = 0; j < v[vertex].size(); j++)
        {
            poz = v[vertex][j];
            if(cost[e[poz].a] + e[poz].c < cost[e[poz].b])
            {
                cost[e[poz].b] = cost[e[poz].a] + e[poz].c;
                if(!f[e[poz].b])
                {
                    f[e[poz].b] = 1;
                    h.push_back(make_pair( -cost[e[poz].b] , e[poz].b));
                    push_heap(h.begin(), h.end());
                }
            }
        }
    }
}
long check_negativ()
{
    long i;
    for(i = 1; i <= m; i++)
        if(cost[e[i].a] + e[i].c < cost[e[i].b])
            return 1;
    return 0;
}
int main()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(i = 1; i <= m; i++)
    {
        scanf("%d%d%d", &e[i].a, &e[i].b, &e[i].c);
        v[e[i].a].push_back(i);
    }
    init();
    solve();
    if(check_negativ())
    {
        printf("Ciclu negativ!\n");
        return 0;
    }
    for(i = 2; i <= n; i++)
        printf("%d ", cost[i]);
    return 0;
}