#include <bits/stdc++.h>
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector < pair < int , int > > v[50005];
int n,m;
int x,y,c;
int dist[50005];
bool inqueue[50005];
const int oo = 2000000001;

struct compare{
    bool operator()(int a, int b) {
        return dist[a]<dist[b];
    }
};

priority_queue < int , vector < int > , compare > pq;

void read() {
    f >> n >> m;
    for (int i=1;i<=m;i++) {
        f >> x >> y >> c;
        v[x].push_back({y,c});
    }
}

void dijkstra() {
    dist[1]=0;
    pq.push(1); inqueue[1]=1;
    fill(dist+2,dist+n+2,oo);
    while (pq.empty()==0) {
        int nod = pq.top();
        pq.pop();
        inqueue[nod]=0;
        for (auto k:v[nod]) {
            if (dist[nod]+k.second<dist[k.first]) {
                dist[k.first] = dist[nod]+k.second;
                if (!inqueue[k.first]) {
                    inqueue[k.first]=1;
                    pq.push(k.first);
                }
            }
        }
    }
}

void show() {
    for (int i=2;i<=n;i++) {
        g << dist[i] << " ";
    }
}

int main()
{
    read();
    dijkstra();
    show();
    return 0;
}