//#include"grader.cpp"
#include<vector>
#include<algorithm>
#include<climits>
#include<queue>
using namespace std;
using ll = long long;

struct t_adi {
    int nodo, peso;
};

struct t_tappa {
    int nodo;
    ll dist;
    friend bool operator <(t_tappa x, t_tappa y) {
        if(x.dist > y.dist) return true;
        return false;
    }
};

void mincammino(int N, int M, vector<int> X, vector<int> Y, vector<int> P, vector<long long>& D) {
    vector<vector<t_adi>> grafo(N);
    for(int i = 0; i < M; i++) {
        grafo[X[i]].push_back({Y[i], P[i]});
    }    

    vector<ll> dist(N, LLONG_MAX);
    vector<bool> processed(N, false);
    priority_queue<t_tappa> coda;
    dist[0] = 0;
    coda.push({0, 0});

    while(!coda.empty()) {
        t_tappa x = coda.top();
        coda.pop();
        if(processed[x.nodo]) continue;
        processed[x.nodo] = true;
        for(t_adi u : grafo[x.nodo]) {
            if(dist[x.nodo] + u.peso < dist[u.nodo]) {
                dist[u.nodo] = dist[x.nodo] + u.peso;
                coda.push({u.nodo, dist[u.nodo]});
            }
        }
    }

    for(ll &x : dist) if(x == LLONG_MAX) x = -1;
    D = dist;
}