#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

const int NMax = 50005;
const int oo = 1000000000;
int N,M,D[NMax];
vector < pair <int, int> > G[NMax];
queue <int> Q,QQ;

void Read()
{
  fin>>N>>M;
  for(int i = 1; i <= M ; ++i)
    {
      int x,y,c;
      fin>>x>>y>>c;
      G[x].push_back(make_pair(y,c));
    }
}

int BellmanFord()
{
  for(int i = 2; i <= N; ++i)
    D[i] = oo;

  Q.push(1);

  for(int k = 1 ; k <= N; ++k)
    {
     while(!Q.empty())
     {
       int i = Q.front(); Q.pop();

        for(int j = 0; j < (int) G[i].size(); ++j)
          {
            int Vecin = G[i][j].first, Cost = G[i][j].second;
            if(D[Vecin] > D[i] + Cost)
              {
                D[Vecin] = D[i] + Cost;
                QQ.push(Vecin);
              }
          }
     }
        while(!QQ.empty())
          {
            Q.push(QQ.front()); QQ.pop();
          }
    }

  for(int i = 1; i <= N; ++i)
        for(int j = 0; j < (int) G[i].size(); ++j)
          {
            int Vecin = G[i][j].first, Cost = G[i][j].second;
            if(D[Vecin] > D[i] + Cost)
              return -1;
          }

  return 0;
}

void Print()
{
  for(int i = 2; i <= N ; ++i)
    fout<<D[i]<<" ";
  fout<<"\n";
}

int main()
{
    Read();
    if(BellmanFord()==-1)
      fout<<"Ciclu negativ!\n";
    else
      Print();
    return 0;
}