#include <bits/stdc++.h>
#ifdef MINA
#include "grader.cpp"
#endif
#include "roads.h"
using namespace std;
#define ll long long
const int N = 2005;
int t[N], curt;
vector<array<int, 2>> adj[N];
void build(int i, int p) {
t[i] = curt++;
vector<array<int, 2>> newadj;
for (auto &[nxt, w] : adj[i]) {
if (nxt == p) continue;
build(nxt, i);
newadj.push_back({t[nxt], w});
}
adj[i] = newadj;
}
vector<vector<int>> dp[N];
vector<ll> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w) {
for (int i = 0; i < n - 1; i++) {
adj[u[i]].push_back({v[i], w[i]});
adj[v[i]].push_back({u[i], w[i]});
}
build(0, -1);
sort(adj[0].begin(), adj[0].end(), [&] (array<int, 2> x, array<int, 2> y) {
return x[1] < y[1];
});
vector<ll> ret(n);
ll s = 0;
for (int i = n - 1; i >= 0; i--) {
ret[i] = s;
if (i > 0) s += adj[0][n - 1 - i][1];
}
return ret;
}
