#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector < pair < int,int > > v[50002];
queue <int> Q;
int dist[50002],viz[50002],n;
int BF()
{
    for(int i=2;i<=n;i++)
    {
        dist[i]=1000000000;
    }
    Q.push(1);
    while(!Q.empty())
    {
        int nod=Q.front();
        viz[nod]++;
        if(viz[nod]==n)
            return 0;
        Q.pop();
        for(int i=0;i<v[nod].size();++i)
        {
            int to,cost;
            to=v[nod][i].first;
            cost=v[nod][i].second;
            if(dist[to]>dist[nod]+cost)
            {
                dist[to]=dist[nod]+cost;
                Q.push(to);
            }
        }
    }
    return 1;
}
int main()
{
    int m,x,y,z;
    ifstream in("bellmanford.in");
    ofstream out("bellmanford.out");
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>z;
        v[x].push_back(make_pair(y,z));
    }
    BF();
    if(!BF)
        out<<"Ciclu negativ!";
    else
    {
        for(int i=2;i<=n;i++)
        {
            out<<dist[i]<<" ";
        }
    }
    return 0;
}