#include<bits/stdc++.h>
using namespace std;

int main(){
  int n;
  cin>>n;
  vector<int> s(n);
  vector<pair<int,int>> vp(n);
  for (int i=0;i<n;i++) cin>>s[i],vp[i]={s[i],i};
  sort(vp.begin(),vp.end());
  vector<vector<int>> g(n);
  for (int i=0;i<n-1;i++){
    int a,b;
    cin>>a>>b;
    a--;b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  vector<long long> dp(n);
  for (auto [val,v]:vp){
    for (int u:g[v]){
      if (s[u]>=s[v]) continue;
      dp[v]=max(dp[v],dp[u]);
    }
    dp[v]+=s[v];
  }
  cout<<*max_element(dp.begin(),dp.end())<<endl;
}