#include "roads.h"
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>
using namespace std;
using ll = long long;
vector<vector<pair<int, int>>> gp;
vector<vector<ll>> dp;
void dfs(int u, int p, int k) {
vector<ll> vec;
for (pair<int, int>& v : gp[u]) {
if (v.first == p) continue;
dfs(v.first, u, k);
dp[u][k] += dp[v.first][k - 1];
vec.push_back(max(0ll, dp[v.first][k - 1] + v.second - dp[v.first][k]));
}
//dp[u][0] =
sort(vec.rbegin(), vec.rend());
for (int i = 0; i < min(int(vec.size()), k); ++i) dp[u][k] += vec[i];
}
vector<ll> minimum_closure_costs(int n, vector<int> U,vector<int> V,vector<int> W) {
gp = vector<vector<pair<int, int>>>(n);
dp = vector<vector<ll>>(n, vector<ll>(n));
ll sm = 0;
for (int i = 0; i < n - 1; ++i) {
gp[U[i]].push_back({ V[i], W[i] });
gp[V[i]].push_back({ U[i], W[i] });
sm += W[i];
}
vector<ll> vec(n);
vec[0] = sm;
for (int i = 1; i < n; ++i) {
dfs(0, -1, i);
vec[i] = sm - dp[0][i];
}
return vec;
}
