#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#define dMAX 100000
#define INF 99999999

using namespace std;

int n, m, x, y, c, p;
vector<pair<int, int> > graf[dMAX + 2];
bool viz[dMAX + 2];
int dij[dMAX + 2];

deque<int> myDeque;
int pVerif, newV;

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

int main()
{
    int i, j;
    fin >> n >> m;
    for (i = 1; i <= m; i++) {
        fin >> x >> y >> c;
        graf[x].push_back({y, c});
        //graf[y].push_back({x, c});
    }
    for (i = 1; i <= n; i++) dij[i] = INF;
    dij[1] = 0;
    viz[1] = true;
    myDeque.push_back(1);
    while (!myDeque.empty()) {
        pVerif = myDeque.front();
        myDeque.pop_front();
        for (i = 0; i < graf[pVerif].size(); i++) {
            newV = graf[pVerif][i].first;
                if (dij[pVerif] + graf[pVerif][i].second < dij[newV]) {
                    dij[newV] = dij[pVerif] + graf[pVerif][i].second;
                    myDeque.push_back(newV);
                    viz[newV] = true;
                }
        }
    }

    for (i = 2; i <= n; i++) {
        if (dij[i] != INF)
        fout << dij[i] << ' ';
        else fout << 0 << ' ';
    }

    return 0;
}