#define MOD_TYPE 2 #pragma region Macros #include using namespace std; #if 0 #include #include using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif #if 1 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif using ll = long long int; using ld = long double; using pii = pair; using pll = pair; using pld = pair; template using smaller_queue = priority_queue, greater>; constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; constexpr ld PI = acos(-1.0); constexpr ld EPS = 1e-7; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; struct io_init { io_init() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template constexpr istream &operator>>(istream &is, pair &p) noexcept { is >> p.first >> p.second; return is; } template constexpr ostream &operator<<(ostream &os, pair &p) noexcept { os << p.first << " " << p.second; return os; } #pragma endregion // -------------------------------------- int n, k; vector E[110]; int leaves[110] = {}; vector vec; ll sum = 0; int dfs0(int v, int p) { if (E[v].size() == 1 and v != 0) return leaves[v] = 1; for (auto [c, l] : E[v]) { if (c == p) continue; leaves[v] += dfs0(c, v); vec.push_back({leaves[c], l}); sum += leaves[c] * l; } return leaves[v]; } ll dp[110][100010] = {}; void solve() { cin >> n >> k; rep(i, n - 1) { int a, b, c; cin >> a >> b >> c; a--, b--; E[a].push_back({b, c}); E[b].push_back({a, c}); } dfs0(0, -1); rep(i, n - 1) rep(j, k + 1) { auto [a, b] = vec[i]; chmax(dp[i + 1][j], dp[i][j]); if (j + b <= k) chmax(dp[i + 1][j + b], dp[i][j] + a * b); } ll ans = 0; rep(j, k + 1) chmax(ans, dp[n - 1][j]); ans += sum; cout << ans << "\n"; } int main() { solve(); }