#include "roads.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 2005;
int con[MAXN];
int n;
ll total = 0;
vector<tuple<int, int, int>> roads; // w, u, v
#define w(i) get<0>(i)
#define u(i) get<1>(i)
#define v(i) get<2>(i)
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
n = N;
for (int i = 0; i < n - 1; i++)
roads.push_back({W[i], U[i], V[i]}), total += (ll)W[i];
sort(roads.begin(), roads.end(), greater<tuple<int, int, int>>());
vector<ll> res;
res.push_back(total);
for (int i = 0; i < n - 1; i++)
total -= w(roads[i]), res.push_back(total);
return res;
}
