#include <bits/stdc++.h>

using namespace std;

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

struct elem
{
    int dest, cost;
};

vector <elem> v[50005];

bool viz[50005];
int dist[50005];
int cnt[50005];

queue <int> q;

int n, m;

int main()
{
    fin >> n >> m;

    for(int i = 1; i <= m; i++)
    {
        int x, y, z;

        fin >> x >> y >> z;

        v[x].push_back({y,z});
    }

    for(int i = 2; i <= n; i++)
        dist[i] = INT_MAX;

    q.push(1);
    viz[1] = true;

    while(!q.empty())
    {
        int node = q.front();

        viz[node] = false;

        q.pop();

        for(int i = 0; i < v[node].size(); i++)
        {
            int Nod = v[node][i].dest;

            cnt[Nod]++;

            if(cnt[Nod] > n)
            {
                fout << "Ciclu negativ!";
                return 0;
            }

            if(dist[Nod] > v[node][i].cost + dist[node])
            {
                dist[Nod] = v[node][i].cost + dist[node];

                if(viz[Nod] == 0)
                {
                    q.push(Nod);
                    viz[Nod] = 1;
                }
            }
        }
    }

    for(int i = 2; i <= n; i++)
        fout << dist[i] << " ";

    return 0;

}