#include <bits/stdc++.h>

using namespace std;

ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

const int Nmax = 5e4 + 3;
const int Mmax = 250003;

#define inf 1000000000

struct muchie
{
    long a, b, c;
}e[Mmax];

long n, m, k, left, right, cost[Nmax], d[Nmax];

vector <long> v[Nmax];
vector <pair <long, long> > nanu;

long verif_negativ()
{
    for(int i = 1; i <= m; ++i)
        if(cost[e[i].a] + e[i].c < cost[e[i].b])
            return 1;
    return 0;
}

void solve()
{
    pair <long, long> pereche;
    long nod, poz;
    long long pas = 0;
    while(nanu.size() && pas <= 1LL * n * m)
    {
        ++pas;
        pop_heap(nanu.begin(), nanu.end());
        pereche = nanu.back();
        nanu.pop_back();
        nod = pereche.second;
        d[nod] = 0;
        for(int j = 0; j < v[nod].size(); ++j)
        {
            poz = v[nod][j];
            if(cost[e[poz].a] + e[poz].c < cost[e[poz].b])
            {
                cost[e[poz].b] = cost[e[poz].a] + e[poz].c;
                if(!d[e[poz].b])
                {
                    d[e[poz].b] = 1;
                    nanu.push_back(make_pair(-cost[e[poz].b], e[poz].b));
                    push_heap(nanu.begin(), nanu.end());
                }
            }
        }
    }
}

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        f >> e[i].a >> e[i].b >> e[i].c;
        v[e[i].a].push_back(i);
    }

    cost[1] = 0;
    for(int i = 2; i <= n; ++i)
        cost[i] = inf;
    nanu.push_back(make_pair(0, 1));
    make_heap(nanu.begin(), nanu.end());

    solve();

    if(verif_negativ())
    {
        g << "Ciclu negativ!\n";
        return 0;
    }

    for(int i = 2; i <= n; ++i)
        g << cost[i] << ' ';
    return 0;
}