#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define N_MAX 50010
#define INF 999999999

using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");

int n, m, c[N_MAX], vis[N_MAX];
vector <pair <int, int> > v[N_MAX];
queue <pair <int, int> > q;

void read()
{
    in >> n >> m;
    for(int i = 0, a, b, c; i < m; i++)
    {
        in >> a >> b >> c;
        v[a].push_back(make_pair(b,c));
    }
}

bool BF()
{
    for(int i = 2; i <= n; i++)
        c[i] = INF;
    q.push(make_pair(1, 0));
    while(!q.empty())
    {
        int node = q.front().first;
        q.pop();
        for(int i = 0; i < v[node].size(); i++)
        {
            if(vis[v[node][i].first] > n) return false;
            else
            {
                if(c[v[node][i].first] > c[node] + v[node][i].second)
                {
                    c[v[node][i].first] = c[node] + v[node][i].second;
                    q.push(make_pair(v[node][i].first, c[v[node][i].first]));
                    vis[v[node][i].first]++;
                }
            }
        }
    }
    return 1;
}

void print()
{
    if(BF())
        for(int i = 2; i <=n; i++)
            out << c[i] << " ";
    else out << "Ciclu negativ!";
}

int main()
{
    read();
    print();
}