#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;

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

const int inf = (1<<30) + 1;

const int NMAX = 5e4 + 1;
int dist[NMAX];
int cnt[NMAX];
vector<pair<int, int> >v[NMAX];
queue<int> q;
bitset<NMAX> inq;

int main()
{
    int n, m, x, y, c, i, j;

    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y, c});
    }

    for(i=2; i<=n; i++)
    {
        dist[i] = inf;
    }

    inq[1] = 1;
    q.push(1);
    cnt[1] = 1;
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        for(pair<int, int> el : v[x])
        {
            int nod = el.first;
            int cost = el.second;
            inq[x] = false;
            if(dist[x] + cost < dist[nod])
            {
                dist[nod] = dist[x] + cost;
                if(!inq[nod])
                {
                    inq[nod] = 1;
                    cnt[nod]++;
                    if(cnt[nod] > n)
                    {
                        fout<<"Ciclu negativ!";
                        fin.close();
                        fout.close();
                        return 0;
                    }
                    q.push(nod);
                }
            }
        }
    }

    for(i=2; i<=n; i++)
    {
        fout<<dist[i]<<' ';
    }

    fin.close();
    fout.close();
    return 0;
}