#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector<pair<int, int>> adi[101];
int distanta[101], vizitat[101];

void dijkstra(int sursa) {
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>> > coada;
    coada.push({0, sursa});

    while(!coada.empty()) {
        int acum = coada.top().second;
        coada.pop();
        if(!vizitat[acum]) {
            vizitat[acum] = 1;
            for(auto i : adi[acum]) {
                if(distanta[acum] + i.second < distanta[i.first]) {
                    distanta[i.first] = distanta[acum] + i.second;
                    coada.push({distanta[i.first], i.first});
                }
            }
        }
    }
}

int main() {
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int a, b, c;
        fin >> a >> b >> c;
        adi[a].push_back({b, c});
    }

    for(int i = 1; i <= n; i++) distanta[i] = 0x3f3f3f3f;
    distanta[1] = 0;

    dijkstra(1);

    for(int i = 2; i <= n; i++) {
        if(distanta[i] == 0x3f3f3f3f) {
            fout << 0 << " ";
        } else {
            fout << distanta[i] << " ";
        }
    }

    return 0;
}