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

using namespace std;

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

vector <int> dijkstra(int src, vector <vector <pair <int,int>>> &graph){
    priority_queue <pair <int,int>> pq;
    vector <int> dist(graph[src].size(),-1);
    pq.push({0,src});

    while (!pq.empty()) {
        auto [dist_curr, node] = pq.top();
        pq.pop();
        dist_curr=-dist_curr;
        if (dist_curr != dist[node]) {continue;}
        for (auto& [nxt,cost] : graph[node]) {
            if (dist[nxt]==-1 || dist[nxt]>dist[node]+cost) {
                dist[nxt]=dist[node]+cost;
                pq.push({-dist[nxt],nxt});
            }
        }
    }
    return dist;
}

int main() {
    int n,m;
    fin >> n >> m;

    vector <vector <pair <int,int>>> graph(n+1);
    for (int i=1;i<=m;i++) {
        int a,b,c;
        fin >> a >> b >> c;
        graph[a].push_back({b,c});
    }
    vector <int> aux=dijkstra(1,graph);
    for (int i=0;i<aux.size();i++) {
        fout << aux[i] << " ";
    }

    return 0;
}