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

using namespace std;

const int Nmax = 50005;

int n, m;
int dist[Nmax];
vector<pair<int, int>> L[Nmax];
priority_queue<pair<int, int>> Q;

void dijkstra() {
    Q.push({0, 1});
    while(!Q.empty()) {
        int nod = Q.top().second;
        int dist_nod = -Q.top().first;
        Q.pop();
        if(dist_nod > dist[nod]) {
            continue;
        }
        for(pair<int, int> x : L[nod]) {
            int vec = x.first;
            if(!dist[vec] || dist[vec] > dist[nod] + x.second) {
                dist[vec] = dist[nod] + x.second;
                Q.push({-dist[vec], vec});
            }
        }
    }
}

int main() {
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    fin >> n >> m;
    while(m--) {
        int x, y, z;
        fin >> x >> y >> z;
        L[x].push_back({y, z});
    }
    dijkstra();
    for(int i = 2; i <= n; i++) {
        fout << dist[i] << " ";
    }
    
    return 0;
}