#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
while (cin>>n){
vector<int> money(n+1);
for (int i = 1; i <= n; ++i) {
cin>>money[i];
}
int child,father;
vector<int> family(money);
for (int i = 0; i < n-1; ++i) {
cin>>father>>child;
family[father] += money[child];
}
int ans = *max_element(family.begin(), family.end());
cout<<ans<<endl;
}
return 0;
}
最富裕的小家庭(华为OD D卷)
最新推荐文章于 2024-07-11 01:14:29 发布