#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second

vector <pair<int,int> > V[50010];
int pr[50010],dist[50010],n,m;
queue <int> Q;
//set <pair<int, int> > S;
bool u[50010];

void Dijkstra(){
    Q.push(1);
    while(!Q.empty()){
        int q;
        q=Q.front();
        Q.pop();
        u[q]=true;
        for (int i=0; i<V[q].size(); i++){
            if (!u[V[q][i].f] && dist[q]+V[q][i].s<dist[V[q][i].f]){
                pr[V[q][i].f]=q;
                dist[V[q][i].f]=dist[q]+V[q][i].s;
                Q.push(V[q][i].f);
            }
        }
    }
}

int main() {
    ifstream cin ("dijkstra.in");
    ofstream cout ("dijkstra.out");
    cin>>n>>m;
    for (int i=1; i<=m; i++){
        int x,y,c;
        cin>>x>>y>>c;
        V[x].pb(mp(y,c));
        V[y].pb(mp(x,c));
    }
    for (int i=2; i<=n; i++) dist[i]=(1<<30);
    Dijkstra();
    for (int i=2; i<=n; i++) cout<<dist[i]<<" ";
    return 0;
}