#include <fstream>
#include <climits>
#include <vector>
#include <set>
#define dim 50010
#define inf INT_MAX
using namespace std;
vector<pair<int,int> >a[dim];
set<pair<int,int> >s;
int d[dim];
int i,n,m,c,nod,vecin,dist,cost,x,y;

int main() {
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y>>c;
        a[x].push_back({y,c});
        a[y].push_back({x,c});
    }
    for (i=1;i<=n;i++) {
        d[i]=inf;
    }
    d[1]=0;
    s.insert({0,1});
    while (!s.empty()) {
        nod=s.begin()->second;
        dist=s.begin()->first;
        s.erase(s.begin());
        for (i=0;i<a[nod].size();i++) {
            vecin=a[nod][i].first;
            cost=a[nod][i].second;
            if (d[vecin]>dist+cost) {
                s.erase({d[vecin],vecin});
                d[vecin]=dist+cost;
                s.insert({d[vecin],vecin});
            }
        }
    }
    for (i=2;i<=n;i++) {
        if (d[i]==inf) fout<<0<<" ";
        else fout<<d[i]<<" ";
    }
    return 0;
}