#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <stdlib.h>
#define MMAX 50005

using namespace std;

int n,m;
struct nod{
   int y;
   int cost;
};
int dmin[MMAX],viz[MMAX],nr[MMAX];

queue<int>q;
vector<nod>Q[MMAX];

ofstream g("bellmanford.out");

void citire()
{
    ifstream f("bellmanford.in");
    f>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y,c;
        f>>x>>y>>c;
        Q[x].push_back({y,c});
    }
}
void rez()
{
    q.push(1);
    viz[1]=1;
    while(!q.empty())
    {
        int x=q.front();
        for(auto &v:Q[x])
        {
            if(dmin[v.y] > dmin[x] + v.cost)
            {
                dmin[v.y] = dmin[x] + v.cost;
                if(viz[v.y]==0)
                    q.push(v.y);
                nr[v.y]++;
                viz[v.y]=1;
                if(nr[v.y] >= n)
                    g<<"Ciclu negativ!",exit(0);
            }
        }
        viz[x] = 0;
        q.pop();
    }
}
void afisare()
{
    for(int i=2;i<=n;i++)
        g<<dmin[i]<<" ";
}

int main()
{
    citire();
    for(int i=2;i<=n;i++)
        dmin[i] = MMAX * 1000;
    rez();
    afisare();
    return 0;
}