#include <bits/stdc++.h> using namespace std; #define pb push_back #define int long long const int inf = 12345; const int mod = 998244353; void opd(){ freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); } struct BIT{ int n; vector<int> ft; void init(int N){ n = N; ft.assign(n + 1, 0); } void add(int pos, int val){ while (pos <= n) { ft[pos] += val; pos += pos & -pos; } } int get(int pos){ int res = 0; while (pos > 0) { res += ft[pos]; pos -= pos & -pos; } return res; } }; struct DSU { vector<int>par, siz; int n; DSU(int N) { n = N + 5; par.resize(n + 1, 0); siz.assign(n + 1, 1); for(int i = 0; i <= n; ++i) par[i] = i; } int _find(int v) { if(par[v] == v) return v; return par[v] = _find(par[v]); } bool unite(int a, int b) { a = _find(a); b = _find(b); if(a != b) { if(siz[a] < siz[b]) swap(a, b); siz[a] += siz[b]; par[b] = a; return 1; } return 0; } }; const int sz = 2e5+5; vector<int>adj[sz], val(sz); int n, k, res; void dfs(int node,int par){ vector<int>vs; for(auto i:adj[node]){ if(i==par){ continue; } dfs(i, node); vs.pb(val[i]); } sort(vs.begin(), vs.end()); for(int i=0;i<vs.size();++i){ if(val[node] + vs[i] <= k){ val[node]+=vs[i]; }else{ res++; } } } void solve(){ cin >> n >> k; for(int i=1;i<=n;++i){ cin>>val[i]; } for(int i=0;i<n-1;++i){ int u, v; cin>>u>>v; adj[u].pb(v); adj[v].pb(u); } dfs(1, 1); cout<<res<<endl; } signed main(){ ios::sync_with_stdio(0); cin.tie(0); //opd(); int T = 1; while(T--){ solve(); } }

paprike.cpp: In function 'void opd()':
paprike.cpp:8:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     freopen("in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
paprike.cpp:9:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     freopen("out.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~