#include<fstream>
#include<vector>
#include<cstring>
#include<deque>
using namespace std;
vector <pair<int, int> > L[50002];
deque<int> q;
bool u[50002];
int n, m, i, x, y, z, nod, vecin, cost, D[50002], nr[50002], ok;
void bellmanford()
{
    while(!q.empty() && ok)
    {
        nod=q.front();
        for(int i=0; i<L[nod].size(); i++)
        {
            vecin=L[nod][i].first;
            cost=L[nod][i].second;
            if(D[vecin]>D[nod]+cost)
            {
                D[vecin]=D[nod]+cost;
                if(u[vecin]==0)
                {
                    q.push_back(vecin);
                    u[vecin]=1;
                    nr[vecin]++;
                    if(nr[vecin]==n)
                    {
                        ok=0;
                        break;
                    }
                }
            }
        }
        u[nod]=0;
        q.pop_front();
    }
}
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
int main()
{
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y>>z;
        L[x].push_back(make_pair(y, z));
    }
    memset(D, 127, sizeof(D));
    q.push_back(1);
    D[1]=0;
    u[1]=1;
    nr[1]=1;
    ok=1;
    bellmanford();
    if(!ok)
    {
        out<<"Ciclu negativ";
        return 0;
    }
    for(i=2; i<=n; i++)
        out<<D[i]<<" ";
    return 0;
}