#include <bits/stdc++.h>
#define MAX 50100
#define INF 100000000
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
struct nod
{
    int y,c;
};
vector <nod>g[MAX];
queue <int>q;
int n,m;
int d[MAX];
int nr[MAX];///de cate ori a fost actualizat cost min
void citire();
bool bf(int node);
int main()
{
    int i;
    citire();
    if(!bf(1))
        fout<<"Ciclu negativ!";
    else
        for(i=2; i<=n; i++)
            fout<<d[i]<<' ';
    return 0;
}
void citire()
{
    int i,x,y,cost;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>cost;
        g[x].push_back({y,cost});
    }
}
bool bf(int node)
{
    int i,vecin,cost,nodecrt;
    for(i=1; i<=n; i++)
        d[i]=INF;
    d[node]=0;
    q.push(node);
    while(!q.empty())
    {
        nodecrt=q.front();
        q.pop();
        for(i=0; i<g[nodecrt].size(); i++)
        {
            vecin=g[nodecrt][i].y;
            cost=g[nodecrt][i].c;
            if(d[vecin]>d[nodecrt]+cost)
            {
                d[vecin]=d[nodecrt]+cost;
                nr[vecin]++;
                if(nr[vecin]==n)
                    return 0;
                q.push(vecin);
            }
        }
    }
    return 1;
}