#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int MAX = 50003;
const int INF = (1<<30)-1;

vector<pair<int, int> >v[MAX];
queue<int> q;
int dist[MAX], n, m, fv[MAX];

bool bm(int source);
void normalize(int source);

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

    int a, b, c;
    scanf("%d%d", &n, &m);
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d%d", &a, &b, &c);
        v[a].push_back(make_pair(b, c));
    }
    if(bm(1))
        for(int i=2; i<=n; i++)
            printf("%d ", dist[i]);
    else
        printf("Ciclu negativ!");
    printf("\n");
    return 0;
}
bool bm(int source)
{
    normalize(source);
    int tata, fiu, cost;
    q.push(source);
    vector<pair<int, int> >::iterator it;
    while(!q.empty())
    {
        tata = q.front();
        q.pop();
        fv[tata]++;
        if(fv[tata] > n)
            return 0;
        for(it=v[tata].begin(); it!=v[tata].end(); ++it)
        {
            fiu = it -> first;
            cost = it -> second;
            if(dist[fiu] > dist[tata] + cost)
            {
                dist[fiu] = dist[tata] + cost;
                q.push(fiu);
            }
        }
    }
    return 1;
}
void normalize(int source)
{
    for(int i=1; i<=n; i++)
        dist[i] = INF;
    dist[source] = 0;
}