#include <fstream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

#define maxn 50010
#define maxm 250010
#define inf 1000000000

struct muchie
{
  long a, b, c;
} edge[maxm];

long n, m, i, j, k, left, right, cost[maxn], f[maxn];
vector <long> v[maxn];
vector <pair<long, long>> h;

void init()
{
    long i;
    cost[1]=0;
    for(i=2; i<=n; i++)
        cost[i]=inf;
    h.push_back(make_pair(0, 1));
    make_heap(h.begin(), h.end());
}

void bellmanford()
{
    pair<long, long> per;
    long i, j, nod, poz;
    long long pas=0;
    while(h.size() && pas <= 1LL*n*m)
    {
        pas++;
        pop_heap(h.begin(), h.end());
        per = h.back();
        h.pop_back();
        nod = per.second;
        f[nod] = 0;
        for(j = 0; j < v[nod].size(); j++)
        {
            poz = v[nod][j];
            if(cost[edge[poz].a] + edge[poz].c < cost[edge[poz].b])
            {
                cost[edge[poz].b] = cost[edge[poz].a] + edge[poz].c;
                if(!f[edge[poz].b])
                {
                    f[edge[poz].b] = 1;
                    h.push_back(make_pair(-cost[edge[poz].b], edge[poz].b));
                    push_heap(h.begin(), h.end());
                }
            }
        }
    }
}

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

void read_input() {
  ifstream fin("bellmanford.in");
  fin >> n >> m;
  for(int i = 1; i <= m; i++) {
    fin >> edge[i].a >> edge[i].b >> edge[i].c;
    v[edge[i].a].push_back(i);
  }
}

int main()
{

    ofstream fout("bellmanford.out");
    read_input();
    init();
    bellmanford();
    if(check_negativ())
    {
        fout << "Ciclu negativ!\n";
        return 0;
    }
    for(i=2; i<=n; i++)
        fout << cost[i] << " ";
    return 0;
}