#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORD(i, a, b) for(ll i = (a); i >= (b); --i)
#define ok cout << "ok\n";
std::vector<ll> minimum_closure_costs(int n, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
vector<vector<int>> g(n);
vector<ll> w; for(auto &x : W) w.pb(x);
sort(rall(w));
ll sum = accumulate(all(w), 0ll);
vector<ll> res(n, 0);
ll cur = 0;
FOR(i, 0, n) {
res[i] = sum - cur;
if(i < n - 1) cur += w[i];
}
return res;
}
