#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
typedef pair<int,int> pii;
const int MAXN=2e5+10;
int n;
vector<pii> g[MAXN];
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,std::vector<int> V,std::vector<int> W){
vector<ll> ans(n);
ll soma=0; for(auto u:W) soma+=u;
sort(all(W),greater<>());
fall(i,0,n-1){
ans[i]=soma;
if(i<sz(W)) soma-=W[i];
}
return ans;
}
