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

#define vt vector
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define pii pair <int, int>

#define fr first 
#define sc second

using namespace std;

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

////////////////////////////////////////////////////////////

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

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

priority_queue <pii, vector <pii>, greater <pii>> pq;

int dist[NMAX + 1];
bool viz[NMAX + 1];

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

    dist[source] = 0;
    pq.push({dist[source], source});

    while(!pq.empty()){
        int node = pq.top().sc;
        pq.pop();

        if(!viz[node]){
            viz[node] = 1;

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

void solve(){
    
    fin >> n >> m;

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

    DJK(1);

    for(int i = 2; i <= n; i++){
        if(dist[i] != INF){
            fout << dist[i] << ' ';
        }else{
            fout << 0 << ' ';
        }
    }
    fout << '\n';
}

int main(){

    int T;
    //fin >> T;

    T = 1;

    while(T--){
        solve();
    }

    return 0;
}