#include <fstream>
#include <climits>
#include <queue>

using namespace std;

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

int n,m,viz[50003],dist[50003];

vector<pair<int,int> >g[50003];

queue<int>coada;

void bellmanford()
{
    coada.push(1);
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        viz[nod]++;
        if(viz[nod]>n)
        {
            fout<<"Ciclu negativ!";
            return;
        }
        for(vector<pair<int,int> > :: iterator it=g[nod].begin();it!=g[nod].end();it++)
        {
            int to=it->first;
            int cost=it->second;
            if(dist[to]>dist[nod]+cost)
            {
                dist[to]=dist[nod]+cost;
                coada.push(to);
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout<<dist[i]<<" ";
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;i++)
        dist[i]=INT_MAX;
    bellmanford();
    
}