#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define nmax 50005
#define inf (1<<30)
using namespace std;

struct nod{
    int y, cost;
} aux;

int n, m, x, y, c;
vector< vector <nod> > gf;
vector<int> dist, used;
queue<int> q;
vector<bool> inq;

bool bellman(int s)
{
    q.push(s);
    inq[s] = true;
    dist[s] = 0;
    used[s]++;

    int  x, vecin, cost;
    while (!q.empty())
    {
        x = q.front();
            q.pop();
        inq[x] = false;

        for(int i=0; i<gf[x].size(); i++)
        {
            vecin = gf[x][i].y;
            cost = gf[x][i].cost;
            if (dist[x] + cost < dist[vecin])
            {
                dist[vecin] = dist[x] + cost;
                if(!inq[vecin]){
                    q.push(vecin);
                    inq[vecin]=true;
                }

                used[vecin]++;
                if (used[vecin] > n)
                {
                    return false;
                }
            }
        }
    }


    return true;
}
int main()
{
    ifstream f("bellmanford.in");
    ofstream g("bellmanford.out");

    f >> n >> m;
    gf.resize(n+1);
    dist.resize(n+1);
    used.resize(n+1);
    inq.resize(n+1);

    for(int i=1; i<=n; i++)
    {
        dist[i] = inf;
        used[i] = 0;
        inq[i] =false;
    }

    for(int i=1; i<=m; i++)
    {
        f >> x >> y >> c;
        aux.y = y;
        aux.cost = c;
        gf[x].push_back(aux);
    }
    if (!bellman(1))
    {
        g << "Ciclu negativ!";
        return 0;
    }

    for(int i=2; i<=n; i++)
    {
        if (dist[i]<inf)
             g << dist[i] << " ";
        else
             g << "0 ";
    }

    f.close();
    g.close();
    return 0;
}