#include <fstream>
#include <limits>
#include <vector>
#include <queue>

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

const int inf = numeric_limits<int>::max();
int n,m,i,x,y,c,viz[50001],d[50001];
bool eq[50001];
struct elem
{
    int y,cost;
};
vector <elem> v[50001];
queue <int> q;

int main()
{
    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++)
        d[i] = inf;

    q.push(1);
    eq[1] = 1;
    while (!q.empty())
    {
        x = q.front();
        q.pop();
        eq[x] = 0;
        for (i = 0; i < v[x].size(); i++)
        {
            y = v[x][i].y;
            if (d[y] > d[x] + v[x][i].cost)
            {
                d[y] = d[x] + v[x][i].cost;
                viz[y]++;
                if (viz[y] > n - 2)
                {
                    fout<<"Ciclu negativ!\n";
                    return 0;
                }
                if (eq[y] == 0)
                {
                    q.push(y);
                    eq[y] = 1;
                }
            }
        }
    }
    for (i = 2; i <= n; i++)
        fout<<d[i]<<" ";
    return 0;
}