#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

vector<int> t_parent;
vi t_ord;

void tree_getorder(const vector<vi> &g, int root) {
	int n = g.size();
	t_parent.assign(n, -1);
	t_ord.clear();

	vector<int> stk; stk.push_back(root);
	while(!stk.empty()) {
		int i = stk.back(); stk.pop_back();
		t_ord.push_back(i);
		for(int j = (int)g[i].size() - 1; j >= 0; j --) {
			int c = g[i][j];
			if(t_parent[c] == -1 && c != root)
				stk.push_back(c);
			else
				t_parent[i] = c;
		}
	}
}

int main() {
	int N;
	while(~scanf("%d", &N)) {
		vector<int> A(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &A[i]);
		vector<vector<int> > g(N);
		for(int i = 0; i < N - 1; ++ i) {
			int u, v;
			scanf("%d%d", &u, &v), -- u, -- v;
			g[u].push_back(v);
			g[v].push_back(u);
		}
		tree_getorder(g, 0);
		vector<int> val(N * 2, -1);
		int ans = 0;
		vector<bool> tmpvis(*max_element(all(A)) + 1);
		vpii v;
		for(int ix = (int)t_ord.size() - 1; ix >= 0; -- ix) {
			int i = t_ord[ix], p = t_parent[i];
			rep(gt, 2) {
				v.clear();
				for(int j : g[i]) if(j != p) {
					if((gt == 0 ? A[i] > A[j] : A[i] < A[j]))
						v.emplace_back(val[j * 2 + (1 - gt)], A[j]);
				}
				int pval = p == -1 ? -1 : A[p];
				//c + c(c-1)/2 + sum v
				sort(all(v));
				reverse(all(v));
				int c1 = 0, c2 = 0, sum1 = 0, sum2 = 0;
				for(auto p : v) {
					if(tmpvis[p.second]) continue;
					tmpvis[p.second] = true;
					++ c1;
					sum1 += p.first;
					if(p.second != pval) {
						++ c2;
						sum2 += p.first;
					}
				}
				for(auto p : v)
					tmpvis[p.second] = false;

				amax(ans, c1 * (c1 - 1) / 2 + sum1);
				val[i * 2 + gt] = c2 * (c2 + 1) / 2 + sum2;
//				cerr << i << ", " << gt << ": " << sum << ", " << c << ", " << c * (c - 1) / 2 + sum << endl;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}