#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define int long long
using namespace std;
ll i,j,mod=1e9+7;
const ll oo=1e9+5;
ll m,n;
ll dis[200005];
bool InCoada[200005];
vector<pair<ll,ll> > Nod[50005];
struct cmp{
    bool operator()(ll x,ll y){
        return dis[x]>dis[y];
    }
};
priority_queue<ll,vector<ll>, cmp> Coada;
void Dijkstra(ll nodstart){
    dis[nodstart]=0;
    Coada.push(nodstart);
    InCoada[nodstart]=true;
    while(!Coada.empty()){
        ll nodcurent=Coada.top();
        Coada.pop();
        InCoada[nodcurent]=false;
        for(i=0;i<Nod[nodcurent].size();i++){
            ll vecin=Nod[nodcurent][i].first;
            ll cost=Nod[nodcurent][i].second;
            if(dis[nodcurent]+cost<dis[vecin]){
                dis[vecin]=cost+ dis[nodcurent];
                if(InCoada[vecin]==false){
                    Coada.push(vecin);
                    InCoada[vecin]=true;
                }
            }
        }
    }
}
int32_t main() {
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin>>n>>m;
    for(i=1;i<=n;i++) dis[i]=oo;
    for(i=1;i<=m;i++){
            ll a,b,c;
            cin>>a>>b>>c;
            Nod[a].pb(make_pair(b,c));
    }
    Dijkstra(1);
    for(i=2;i<=n;i++){
        if(dis[i]!=oo){
            cout<<dis[i]<<" ";
        }
        else cout<<0<<" ";
    }
}