#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
vector<long long> ans;
int sub1 = 1, sub2 = 1;
for(int i = 0;i < N-1; i++){
if(U[i] != 0) sub1 = 0;
if(U[i] != i or V[i] != i+1) sub2 = 0;
}
int sum = 0LL;
for(int i = 0;i < N-1; i++) sum+= W[i];
ans.push_back(sum);
if(sub1){
sort(W.begin(), W.end());
sum = 0LL;
for(int i = 0;i < N-1; i++){
sum += W[i];
ans.push_back(sum);
}
}else if(sub2){
}else{
}
return ans;
}
//main(){
// int N; cin >> N;
// vector<int> U(N), V(N), W(N);
// for(int i = 0;i < N-1; i++){
// cin >> U[i] >> V[i];
// }
// for(int i = 0;i < N-1; i++) cin >> W[i];
//
// vector<long long> ans = minimum_closure_costs(N, U, V, W);
//
//}
