#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();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
ifstream fin("dijkstra.in"); ofstream fout("dijkstra.out");
#define cin fin
#define cout fout

int n, m;
int d[50010];
bool v[50010];
vector<pii> g[50010];
void dijkstra(){
multiset<pii> h;
h.insert(mp(0, 1));

while(!h.empty()){
pii f=(*h.begin()); h.erase(h.begin());


for(int i=0; i<g[f.sc].size(); i++){
    if(h.find(mp(d[g[f.sc][i].ft ], g[f.sc][i].ft) )!=h.end()  ){
        if(d[g[f.sc][i].ft ]>f.ft+g[f.sc][i].sc){
        h.erase(h.find(mp(d[g[f.sc][i].ft ], g[f.sc][i].ft) ) );}
        else{continue;}
    }

    if(v[g[f.sc][i].ft] ) {d[g[f.sc][i].ft ]=min(d[g[f.sc][i].ft ], f.ft+g[f.sc][i].sc);}
    else{d[g[f.sc][i].ft ]=f.ft+g[f.sc][i].sc;}
    v[g[f.sc][i].ft ]=true;
    h.insert(mp(d[g[f.sc][i].ft ], g[f.sc][i].ft ) );
}


}




return;
}



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

dijkstra();

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

return 0;
}