#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#include <string.h>
#define dMAX 50000
#define INF 999999

using namespace std;

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

char nr[30];

deque<int> myDeque;
int pVerif, newV;

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

int main()
{
    int i, j;
    fin >> n >> m;
    fin.get();
    for (j = 1; j <= m; j++) {
        fin.getline(nr, 30);
        len = strlen(nr);
        t = 0;
        i = 0;
        while (isdigit(nr[i])) {
            t *= 10;
            t += (int)nr[i] - '0';
            i++;
        }
        i++;
        x = t;
        t = 0;
        while (isdigit(nr[i])) {
            t *= 10;
            t += (int)nr[i] - '0';
            i++;
        }
        y = t;
        t = 0;
        i++;
        while (isdigit(nr[i])) {
            t *= 10;
            t += (int)nr[i] - '0';
            i++;
        }
        c = t;
        //cout << x << ' ' << y << ' ' << c << '\n';
        graf[x].push_back({y, 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;
}