#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

#define MAX 50005
#define INF 50000005

int n, m, a, b, c, d[MAX], k[MAX];
bool viz[MAX];
vector<pair<int, int> > g[MAX];
queue<int> q;

bool bellmanford()
{
    for(int i = 1; i <= MAX; ++i)
    {
        d[i] = INF;
        viz[i] = false;
    }
    q.push(1);
    d[1] = 0;
    viz[1] = true;
    k[1] = 1;
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        viz[x] = false;
        for(int i = 0; i < g[x].size(); ++i)
        {
            int v = g[x][i].first;
            int cost = g[x][i].second;
            if(d[x] + cost < d[v])
            {
                d[v] = d[x] + cost;
                if(!viz[v])
                {
                    q.push(v);
                    viz[v] = true;
                    k[v]++;
                    if(k[v] > n)
                    {
                        return false;
                    }
                }
            }
        }
    }
    return true;
}

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        cin >> a >> b >> c;
        g[a].push_back(make_pair(b, c));
    }
    bool cn = bellmanford();
    if(!cn)
    {
        cout << "Ciclu negativ!" << '\n';
        return 0;
    }
    for(int i = 2; i <= n; ++i)
    {
        cout << d[i] << ' ';
    }
    cout << '\n';
    return 0;
}