#include <fstream>
#include <vector>
#include <queue>

#define pii pair<int,int>

using namespace std;

int n, m, x, y, c;

vector<vector<pii>> arches;
vector<int> visited;
vector<int> distances;
priority_queue<pii, vector<pii>, greater<pii>> pq;

void Bellman(){
    distances[0] = 0;
    bool changed = true;
    while(changed){
        changed = false;
        for(int i=0;i<n;++i)
            for(auto itr: arches[i])
                if(distances[i] + itr.second < distances[itr.first]) {
                    distances[itr.first] = distances[i] + itr.second;
                    changed = true;
                }
    }
}

int main(){
    ifstream fin("bellmanford.in");
    ofstream fout("bellmanford.out");

    fin>>n>>m;
    arches.resize(n+1);
    visited.resize(n+1, false);
    for(int i=0;i<=n;i++)
        distances.push_back(2e9);
    for(int i=0;i<m;i++){
        fin>>x>>y>>c;
        arches[x-1].push_back({y-1, c});
    }

    Bellman();

    for(int i=1;i<n;++i){
        if(distances[i]!=2e9) fout<<distances[i]<<" ";
        else fout<<0<<" ";
    }

    return 0;
}