#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll cost[1000000];
void dfs(int node,vector<int>t[],vector<int>&v,vector<int>&parent,vector<int>&b){
v[node]=1;
for(auto it:t[node]){
if(v[it]==0){
parent[it]=node;
dfs(it,t,v,parent,b);
}
}
ll c1=0;
for(auto child:t[node]){
if(child!=parent[node])c1=max(c1,cost[child]);
}
cost[node]=c1+b[node];
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int>t[n+1],b(n+1);
for(int i=1;i<=n;i++)cin>>b[i];
for(int i=1;i<n;i++){
int x,y;
cin>>x>>y;
t[x].push_back(y);
t[y].push_back(x);
}
vector<int>v(n+1),parent(n+1);
dfs(1,t,v,parent,b);
ll c=-10000000;
for(int i=1;i<=n;i++)c=max(c,cost[i]);
cout<<c<<"\n";
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCiNkZWZpbmUgbGwgbG9uZyBsb25nCmxsIGNvc3RbMTAwMDAwMF07Cgp2b2lkIGRmcyhpbnQgbm9kZSx2ZWN0b3I8aW50PnRbXSx2ZWN0b3I8aW50PiZ2LHZlY3RvcjxpbnQ+JnBhcmVudCx2ZWN0b3I8aW50PiZiKXsKICAgIHZbbm9kZV09MTsKICAgIGZvcihhdXRvIGl0OnRbbm9kZV0pewogICAgICAgIGlmKHZbaXRdPT0wKXsKICAgICAgICAgICAgcGFyZW50W2l0XT1ub2RlOwogICAgICAgICAgICBkZnMoaXQsdCx2LHBhcmVudCxiKTsKICAgICAgICB9CiAgICB9CiAgICBsbCBjMT0wOwogICAgZm9yKGF1dG8gY2hpbGQ6dFtub2RlXSl7CiAgICAgICAgaWYoY2hpbGQhPXBhcmVudFtub2RlXSljMT1tYXgoYzEsY29zdFtjaGlsZF0pOwogICAgfQogICAgY29zdFtub2RlXT1jMStiW25vZGVdOwp9CgppbnQgbWFpbigpewogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKE5VTEwpOwogICAgaW50IG47CiAgICBjaW4+Pm47CiAgICB2ZWN0b3I8aW50PnRbbisxXSxiKG4rMSk7CiAgICBmb3IoaW50IGk9MTtpPD1uO2krKyljaW4+PmJbaV07CiAgICBmb3IoaW50IGk9MTtpPG47aSsrKXsKICAgICAgICBpbnQgeCx5OwogICAgICAgIGNpbj4+eD4+eTsKICAgICAgICB0W3hdLnB1c2hfYmFjayh5KTsKICAgICAgICB0W3ldLnB1c2hfYmFjayh4KTsKICAgIH0KICAgIHZlY3RvcjxpbnQ+dihuKzEpLHBhcmVudChuKzEpOwogICAgZGZzKDEsdCx2LHBhcmVudCxiKTsKICAgIGxsIGM9LTEwMDAwMDAwOwogICAgZm9yKGludCBpPTE7aTw9bjtpKyspYz1tYXgoYyxjb3N0W2ldKTsKICAgIGNvdXQ8PGM8PCJcbiI7CiAgICByZXR1cm4gMDsKfQ==