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

#define pii pair <int, int>
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define pb push_back
#define fr first
#define sc second
#define vt vector
#define ub upper_bound
#define lb lower_bound

using namespace std;

string filename = "bellmanford";
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

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

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

bool inQ[NMAX + 1];

int f[NMAX + 1];
int dist[NMAX + 1];

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

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

    while(!Q.empty()){
        int node = Q.front();
        Q.pop();
        inQ[node] = 0;

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

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

int main(){

    fin >> n >> m;

    for(int i = 1; i <= m; i++){
        int a, b, c;
        fin >> a >> b >> c;

        adj[a].pb({b, c});
    }

    BF(1);

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

    return 0;
}