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

using namespace std;

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

vector<pair<int,int> > v[MAXN];
queue<int> cd;
pair<int,int> a;
int vizitat[MAXN];
int drum[MAXN];
int n,m,i,j,x,y,c,aux,nod;

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