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

int n,m,A[50010];
bool u[50010];
vector <pair<int,int> > V[50010];
queue <int> Q;

void Dijkstra(){
    int x;
    while (!Q.empty()){
        x=Q.front();
        Q.pop();
        u[x]=true;
        for (int i=0; i<V[x].size(); i++){
            if (!u[V[x][i].f]) A[V[x][i].f]=min(A[V[x][i].f],A[x]+V[x][i].s);
        }
    }
}

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