#include <iostream>
#include <fstream>
#include <algorithm>
#include <utility>
#include <queue>
#define NMAX 50001
#define INF 10002
#define nod first
#define cost second
using namespace std;
vector< pair<int, int> > a[NMAX];
queue<int> coada;

bool inCoada[NMAX];

int n,m,x,y,c,d[NMAX],iterariNod[NMAX],nod;

int main()
{
    ifstream in("bellmanford.in");
    ofstream out("bellmanford.out");
    in >> n >> m;
    for(int i=0;i<m;i++)
    {
        in >> x >> y >> c;
        a[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;i++)
    {
        d[i]= INF;
    }
    coada.push(1);
    inCoada[1]=true;
    while(!coada.empty())
    {
        nod = coada.front();
        coada.pop();
        inCoada[nod]=false;
        for(int i=0;i<a[nod].size();i++)
        {
            if(d[a[nod][i].nod]> d[nod]+a[nod][i].cost)
            {
                d[a[nod][i].nod] = d[nod]+a[nod][i].cost;
                if(!inCoada[a[nod][i].nod])
                {
                    coada.push(a[nod][i].nod);
                    inCoada[a[nod][i].nod]=true;
                    if(++iterariNod[a[nod][i].nod]>n)
                    {
                        out << "Ciclu negativ! \n";
                        return 0;
                    }
                }
            }
        }
    }

    for(int i=2;i<=n;i++)
        out << d[i] << " ";
    return 0;
}