#include <cstdio>
#include <queue>

const int MAX_MUCHIE = 250000;
const int MAX_N = 50000;
const int INF = 1000000000;
int mc[1+2*MAX_MUCHIE], next[1+MAX_MUCHIE], cost[1+MAX_MUCHIE];
int viz[1+MAX_N], dist[1+MAX_N];
bool ch[1+MAX_N];
int last[1+MAX_N];
bool inQ[1+MAX_N];

std::queue<int> d;

void addMuchie(int a, int b, int id, int c) {
  next[id] = last[a];
  last[a] = id;
  mc[id] = b;
  cost[id] = c;
}

int main() {
  int n, m, a, b, c, x;
  bool nc;
  FILE *fin = fopen("bellmanford.in", "r");
  fscanf(fin, "%d%d", &n, &m);
  for(int i = 1; i <= m; ++i) {
    fscanf(fin, "%d%d%d", &a, &b, &c);
    addMuchie(a, b, i, c);
  }
  fclose(fin);

  d.push(1);
  inQ[1] = true;

  dist[1] = 0;
  for(int i = 2; i <= n; ++i)
    dist[i] = INF;
  nc = false;
  while(!d.empty() && !nc) {
    x = d.front();
    ch[x] = true;
    d.pop();
    inQ[x] = false;
    if(viz[x] > n)
      nc = true;
    int i = last[x];
    while(i != 0) {
      if(dist[x] + cost[i] < dist[mc[i]] && !inQ[mc[i]]) {
        dist[mc[i]] = dist[x] + cost[i];
        viz[mc[i]]++;
        d.push(mc[i]);
        inQ[mc[i]] = true;
      }
      i = next[i];
    }
  }

  FILE *fout = fopen("bellmanford.out", "w");
  if(nc)
    fprintf(fout, "Ciclu negativ!");
  else
    for(int i = 2; i <= n; ++i)
      fprintf(fout, "%d ", dist[i]);
  fclose(fout);
  return 0;
}