//NU MERGE PENTRU ARCE DE COST NEGATIV!!


#include <fstream>
#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

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

const int MAX = 50001;
const int INF = 1 << 20;
struct comp {
    bool operator() (const pair<int, int> &a, const pair<int, int> &b) {
        return a.second > b.second;
    }
};
priority_queue<pair<int, int>, vector<pair<int, int>>, comp> Q;
vector<pair<int, int>> G[MAX];

int D[MAX];  //retine costul minim al drumului pana la fiecare nod, care trece doar prin nodurile vizitate
int N, M;
bool viz[MAX];  //vectorul caracteristic al multimii nodurilor pt care drumul de cost minim este deja calculat

void dijkstra() {
    int i, vf, nod, cost, lg;
    while (!Q.empty()) {
        vf = Q.top().first;
        Q.pop();
        if (viz[vf]) //daca nodul se afla deja in multime, trecem peste
            continue;
        lg = G[vf].size();
        for (i = 0; i < lg; i++) {
            nod = G[vf][i].first;
            cost = G[vf][i].second;
            if (!viz[nod] && D[vf] + cost < D[nod]) {   //nu are rost sa verificam pentru noduri aflate deja in multime
                D[nod] = D[vf] + cost;
                Q.push (pair<int, int> (nod, D[nod]));
            }
        }
        viz[vf] = true; //adaugam nodul vf la multimea nodurilor pt care am calculat deja drumul minim
    }
}

int main() {

    for (int i = 1; i <= N; i++)
        D[i] = INF;
    D[1] = 0;

    int x, y, cost, minim, nod;
    in >> N >> M;
    for (int i = 1; i <= M; i++) {
        in >> x >> y >> cost;
        G[x].push_back (pair<int, int> (y, cost));
        if(x == 1) {
            D[y] = cost;
            if(cost < minim)
                minim = cost, nod = y;
        }
    }

    viz[1] = true;
    Q.push (pair<int, int> (nod, D[nod]));
    dijkstra();

    for (int i = 2; i <= N; i++)
        if (D[i] < INF)
            out << D[i] << ' ';
        else
            out << 0 << ' ';

    return 0;
}