#include <fstream>
#include <queue>
#include <vector>

using namespace std;

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

const int INF = 1e9;

const int N = 5e4;
int dist[N + 1], f[N + 1];

int n, m, x, y, z;

struct ceva
{
    int node, dist;
    bool operator < (const ceva &a)const
    {
        return dist > a.dist;
    }
};

vector <ceva> g[N + 1];

priority_queue <ceva> q;

void dijkstra (int start)
{
    for (int i = 1; i <= n; ++i)
        dist[i] = INF;
    dist[start] = 0;
    q.push({start, 0});
    while (!q.empty() && f[q.top().node] < n)
    {
        ceva x = q.top();
        f[x.node]++;
        q.pop();
        if (x.dist > dist[x.node])
            continue;
        for (auto it : g[x.node])
            if (dist[it.node] > dist[x.node] + it.dist)
                dist[it.node] = dist[x.node] + it.dist, q.push({it.node, dist[it.node]});
    }
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        cin >> x >> y >> z;
        g[x].push_back({y, z});
    }
    dijkstra (1);
    for (int i = 1; i <= n; ++i)
        if (f[i] >= n)
        {
            cout << "Ciclu negativ!\n";
            return 0;
        }
    for (int i = 2; i <= n; ++i)
        cout << dist[i] << ' ';
    return 0;
}