#include <fstream>
#include <vector>
#include <queue>    
#define INF (1 << 30) - 1
std::vector<std::vector<std::pair<int, int>>> V;
std::vector<int> dist, viz;
int main(){
    freopen("dijkstra.in", "r", stdin);
    int n, m;
    scanf("%d%d", &n, &m);
    V = std::vector<std::vector<std::pair<int, int>>> (n + 1);
    dist = viz = std::vector<int> (n + 1);
    for(int i = 1; i <= m; ++i){
        int x, y, c;
        scanf("%d%d%d", &x, &y, &c);
        V[x].push_back({y, c});
    }
    dist[1] = 0;
    for(int j = 2; j <= n; j++)
        dist[j] = INF;
    std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>, std::greater<std::pair<int, int>> > Q;
    Q.push({0, 1});
    viz[1] = 1;
    int ok = 1;
    while(!Q.empty()){
        int node = Q.top().second;
        Q.pop();
        if(ok == 0) break;
        for(std::pair<int, int> it : V[node]){
            if(dist[it.first] > dist[node] + it.second){
                dist[it.first] = dist[node] + it.second;
                Q.push({dist[it.first], it.first});
            }
        }
    }
    freopen("dijkstra.out", "w", stdout);
    for(int i = 2; i <= n; i++){
        if(dist[i] == INF) 
            printf("0 ");
        else
            printf("%d ", dist[i]);
    }
}