#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <queue>

#include <iomanip>

using namespace std;

string filename = "bellmanford";

#ifdef LOCAL
    ifstream fin("input.in");
    ofstream fout("output.out");
#else
    ifstream fin(filename + ".in");
    ofstream fout(filename + ".out");
#endif


#define pii pair <int, int>

const int NMAX = 5e4;
const int INF = 1e9 + 1;

int n, m;
vector <pii> adj[NMAX + 1];

int dist[NMAX + 1];

bool inQ[NMAX + 1];
int f[NMAX + 1];

void bf(int source){
    for(int i = 1; i <= n; i++){
        dist[i] = INF;
    }

    queue <int> Q;
    Q.push(source);
    inQ[source] = true;
    dist[source] = 0;

    while(!Q.empty()){
        int node = Q.front();
        Q.pop();

        inQ[node] = false;

        if(++f[node] > n){
            fout << "Ciclu negativ!\n";
            exit(0);
        }

        for(pii vec : adj[node]){
            if(dist[node] + vec.second < dist[vec.first]){
                dist[vec.first] = dist[node] + vec.second;
                if(!inQ[vec.first]){
                    Q.push(vec.first);
                }
            }
        }
    }
}

signed main(){

    fin >> n >> m;

    for(int i = 1; i <= m; i++){
        int a, b, c;
        fin >> a >> b >> c;
        adj[a].push_back({b, c});
    }

    bf(1);

    for(int i = 2; i <= n; i++){
        fout << dist[i] << ' ';
    }
    fout << '\n';

    return 0;
}