func_code_string: #include <bits/stdc++.h>   using namespace std;   int n, m;   int p[2 * 100001], rnk[2 * 100001];   int cnt[2 * 100001];   long long pref[2 * 100001 + 5];   long long ans[2 * 100001 + 5];   vector<pair<int, int> > q;   struct Edge {     int a, b;     int w;     Edge(int a, int b, int w) : a(a), b(b), w(w) {}   };   vector<Edge> e;   bool comp(const Edge &one, const Edge &two) { return one.w < two.w; }   void init() {     pref[0] = 0;     for (int i = 1; i <= 2 * 100001; ++i) pref[i] = pref[i - 1] + (i - 1);   }   void dsu_init() {     for (int i = 0; i < 2 * 100001; ++i) {       p[i] = i;       rnk[i] = 0;       cnt[i] = 1;     }   }   int dsu_find(int v) {     if (p[v] == v) return v;     return p[v] = dsu_find(p[v]);   }   int dsu_meld(int a, int b, int &prev) {     a = dsu_find(a), b = dsu_find(b);     if (a == b) return 0;     if (rnk[a] < rnk[b]) swap(a, b);     p[b] = a;     cnt[a] += cnt[b];     prev = cnt[b];     if (rnk[a] == rnk[b]) ++rnk[a];     return cnt[a];   }   int main() {     cin.sync_with_stdio(0);     cin.tie(NULL);     cout.tie(NULL);     init();     dsu_init();     cin >> n >> m;     int a, b, w;     for (int i = 0; i < n - 1; ++i) {       cin >> a >> b >> w;       --a, --b;       e.emplace_back(a, b, w);     }     sort(e.begin(), e.end(), comp);     for (int i = 0; i < m; ++i) {       cin >> a;       q.push_back({a, i});     }     sort(q.begin(), q.end());     long long sum = 0;     int bnd = 0;     int prev, now;     for (int i = 0; i < q.size(); ++i) {       for (int j = bnd; j < e.size(); ++j) {         if (e[j].w > q[i].first) break;         now = dsu_meld(e[j].a, e[j].b, prev);         sum -= pref[prev];         sum += (pref[now] - pref[now - prev]);         ++bnd;       }       ans[q[i].second] = sum;     }     for (int i = 0; i < m; ++i) cout << ans[i] <<    ;     return 0;   }   