#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
vector <pi> g[50001];
int d[50001];
int n, m, x, y, c;


struct comp{
    bool operator()(int a,int b){
         return a>b;
    }
};

priority_queue <pi, vector<pi>, greater<pi>> p;

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    ifstream cin("dijsktra.in");
    ofstream cout("dijsktra.out");
    cin>>n>>m;
    for(int i=1; i<=m; i++){
        cin>>x>>y>>c;
        g[x].pb({y, c});
    }
    /*for(int i=1; i<=5; i++){cin>>x; p.push(x);}
    p.pop();
    cout<<p.top();*/
    for(int i=2; i<=n; i++) d[i]=INT_MAX;
    p.push({1, 0});
    while(!p.empty()){
        int v=p.top().x;
        p.pop();
        for(int i=0; i<g[v].sz; i++){
            if(d[g[v][i].x]>d[v]+g[v][i].y){
                d[g[v][i].x]=d[v]+g[v][i].y;
                p.push({g[v][i].x, d[g[v][i].x]});
            }
        }
    }
    for(int i=2; i<=n; i++){
        if(d[i]==INT_MAX) cout<<0<<" ";
        else cout<<d[i]<<" ";
    }
}