#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "bellmanford.in";
const char outfile[] = "bellmanford.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 50005;
const int oo = 0x3f3f3f3f;

typedef vector<pair<int, int> > Graph[MAXN];
typedef vector<pair<int, int> > :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

Graph G;
int N, M;
int dp[MAXN], inQs[MAXN];
bitset <MAXN> inQ;

inline void BellmanFord(int dp[MAXN], int inQs[MAXN], vector <pair<int, int> > *adj, bitset <MAXN> inQ) {
    for(int i = 1 ; i <= N ; ++ i)
        dp[i] = oo;
    memset(inQs, 0, sizeof(inQs));
    inQ.reset();
    queue <int> Q;
    Q.push(1);
    dp[1] = 0;
    inQ[1] = 1;
    inQs[1] = 1;
    while(!Q.empty()) {
        int Node = Q.front();
        Q.pop();
        for(It it = G[Node].begin(), fin = G[Node].end(); it != fin ; ++ it)
            if(dp[it->first] > dp[Node] + it->second) {
                dp[it->first] = dp[Node] + it->second;
                if(!inQ[it->first]) {
                    inQ[it->first] = true;
                    if(inQs[it->first] > N) {
                        fout << "Ciclu negativ!\n";
                        exit(0);
                    }
                    ++ inQs[it->first];
                    Q.push(it->first);
                }
            }
        inQ[Node] = false;
    }
}

int main() {
    fin >> N >> M;
    for(int i = 1 ; i <= M ; ++ i) {
        int x, y, z;
        fin >> x >> y >> z;
        G[x].push_back(make_pair(y, z));
    }
    BellmanFord(dp, inQs, G, inQ);
    for(int i = 2 ; i <= N ; ++ i)
        fout << dp[i] << ' ';
    fin.close();
    fout.close();
    return 0;
}