#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define INF 1<<30

using namespace std;

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

vector<pair<int,int> > v[50001];
int drum[50001];
pair<int,int> a;

int n,m,i,x,y,c,aux;
int vizitat[50001];
queue<int> cd;

int main()
{
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    cd.push(1);
    for (i=1;i<=n;i++)
        drum[i] = INF;
    drum[1] = 0;
    while (!cd.empty())
    {
        aux = cd.front();
        cd.pop();
        if (vizitat[aux] == n)
        {
            fout<<"Ciclu negativ!";
            return 0;
        }
        for (vector<pair<int,int> >::iterator it = v[aux].begin(); it != v[aux].end(); it ++)
        {
            a = *it;
            if (drum[a.first] > drum[aux] + a.second)
            {
                drum[a.first] = drum[aux] + a.second;
                cd.push(a.first);
                vizitat[a.first]++;
            }
        }
    }
    for (i=2;i<=n;i++)
    {
        fout<<drum[i]<<" ";
    }
    return 0;
}