#include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
using ll = long long;

void mincammino(int N, int M, vector<int> X, vector<int> Y, vector<int> P, vector<long long>& D) {

  vector<vector<pair<int,int>>> g(N);

  for (int m = 0; m < M; m++) {
    int a = X[m], b = Y[m], c = P[m];
    g[a].push_back({b,c});
  }

  vector<ll> mincost(N, LLONG_MAX); mincost[0] = 0;
  priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<>> pq;
  pq.push({0,0});

  while (!pq.empty()) {

    auto [costo, nodo] = pq.top(); pq.pop();

    if (mincost[nodo] < costo) continue;
    
    for (auto [vicino, cost] : g[nodo]) {

      if (mincost[vicino]>costo+cost) {
        mincost[vicino] = costo+cost;
        pq.push({costo+cost,vicino});
      }
      
    }
    
  }

  for (int i = 0; i < N; i++) {
    if (mincost[i] == LLONG_MAX) mincost[i] = -1;
  }

  D = mincost;
  return;
  
}