#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll


ifstream fin("dijkstra.in"); ofstream fout("dijkstra.out");
#define cin fin
#define cout fout



int n, m;
vector<pair<int, int>> g[50010];


bool v[50010];
int d[50010];

void dijkstra(int s){

multiset<pii> ms;
ms.insert({0, 1});

while(!ms.empty()){
    auto pr=*ms.begin(); ms.erase(ms.begin());
    int d0=pr.ft, f=pr.sc;
    v[f]=true;
    d[f]=d0;
    for(auto pr:g[f]){
        int u=pr.ft, c=pr.sc;
        if(v[u]==true){
            continue;
        }
        if( (d[u]==0) ){
            d[u]=d0+c;
            ms.insert({d[u], u});
        }
        else{
            if(d[u]>(d0+c ) ){
                ms.erase({d[u], u});
                d[u]=d0+c;
                ms.insert({d[u], u});
            }
        }
    }
}
return;
}



int32_t main(){
INIT
cin>>n>>m;
for(int i=1; i<=m; i++){
    int u, v, c;
    cin>>u>>v>>c;
    g[u].pb({v, c});
}

dijkstra(1);


for(int i=2; i<=n; i++){
    cout<<d[i]<<" ";
}

return 0;
}