#include <bits/stdc++.h>

struct edge
{
    int v, cost;
};

int nodes, edges, u, v, cost;

std :: vector<edge> adj[50001];

int distance[50001], visited[50001], OO = (1 << 31) - 1;

bool inQueue[50001];

struct orderByDistance
{
    bool operator()(int x, int y)
    {
        return distance[x] > distance[y];
    }
};

std :: priority_queue<int, std :: vector<int>, orderByDistance> Q;

bool Dijkstra(int source)
{
    for(int i = 1; i <= nodes; i++)
    {
        distance[i] = OO;
    }

    distance[source] = 0;

    Q.push(source);

    inQueue[source] = true;

    while(!Q.empty())
    {
        int u = Q.top(); Q.pop();

        inQueue[u] = false;

        for(edge i : adj[u])
        {
            int v = i.v, cost = i.cost;

            if(distance[v] > distance[u] + cost)
            {
                if(++visited[v] == nodes)
                {
                    return false;
                }

                distance[v] = distance[u] + cost;

                if(!inQueue[v])
                {
                    Q.push(v);

                    inQueue[v] = true;
                }
            }
        }
    }

    return true;
}

int main()
{

    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);

    scanf("%d %d", &nodes, &edges);

    for(int i = 1; i <= edges; i++)
    {
        scanf("%d %d %d", &u, &v, &cost);

        adj[u].push_back({v, cost});
    }

    if(Dijkstra(1))
    {
        for(int i = 2; i <= nodes; i++)
        {
            printf("%d ", distance[i]);
        }
    }
    else
    {
        printf("Ciclu negativ!");
    }

    return 0;
}