#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <limits.h>
#define NLIM 50001

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

int n, m, dis[NLIM], inCoada[NLIM];
vector< pair<int, int> > Muchii[NLIM];
struct comparator {
    bool operator()(int a, int b) {
        return dis[a] > dis[b];
    }
};
priority_queue<int, vector<int>, comparator> Coada;

void Dijkstra(int start) {
    dis[start] = 0;
    Coada.push(start);
    inCoada[start] = 1;

    while(!Coada.empty()) {
        int nod = Coada.top();
        Coada.pop();
        inCoada[nod] = 0;

        for(int i=0; i<Muchii[nod].size(); i++) {
            int vecin = Muchii[nod][i].first;
            int cost = Muchii[nod][i].second;

            if(dis[nod] + cost < dis[vecin]) {
                dis[vecin] = dis[nod] + cost;

                if(inCoada[vecin] == 0) {
                    Coada.push(vecin);
                    inCoada[vecin] = 1;
                }
            }
        }
    }
}

void citire() {
    f >> n >> m;
    for(int i=1; i<=n; i++) dis[i] = INT_MAX;
    for(int i=1; i<=m; i++) {
        int s, d, c;
        f >> s >> d >> c;
        Muchii[s].push_back(make_pair(d, c));
    }
}
void afisare() {
    for(int i=2; i<=n; i++)
        if(dis[i] < INT_MAX)
            g << dis[i] << " ";
        else g << 0 << " ";
}

int main() {
    citire();
    Dijkstra(1);
    afisare();
    return 0;
}