#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
const int INF = 1e9;
int n,m,d[50005],u,v,w,eq[500005],viz[50005];
bool neg;

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d%d",&n,&m); neg = false;
    vector<vector<ii> > a(n+1);
    queue<int> q;
    for (int i = 0; i<m; ++i)
    {
        scanf("%d%d%d",&u,&v,&w);
        a[u].push_back(ii(v,w));
    }
    for (int i = 1; i<=n; ++i)
    {
        d[i] = INF;
    }
    d[1] = 0; eq[1] = 1;
    q.push(1);
    while (!q.empty())
    {
        v = q.front(); q.pop();
        eq[v] = 0;
        for (int i = 0; i<(int)a[v].size(); ++i)
        {
            ii k = a[v][i];
            if (d[v] + k.second < d[k.first])
            {
                d[k.first] = d[v] + k.second;
                viz[k.first]++;
                if (viz[k.first]>n)
                {
                    printf("Ciclu negativ!");
                    return 0;
                }
                if (eq[k.first] == 0)
                {
                    q.push(k.first);
                    eq[k.first] = 1;
                }
            }
        }
    }
    for (int i = 2; i<=n; ++i)
    {
        printf("%d ",d[i]);
    }
}