#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

const int INF = INT_MAX / 4;

vector<int> a;
vector<vector<int> > edges;

map<tuple<int, int, int>, int> memo;

int solve(int curr, int prev, int prevValue)
{
    if(memo.find(make_tuple(curr, prev, prevValue)) != memo.end())
        return memo[make_tuple(curr, prev, prevValue)];

    map<int, int> maxValue;
    for(int next : edges[curr]){
        if(next == prev || a[next] == prevValue || ((a[curr] < prevValue) ^ (a[curr] < a[next])))
            continue;
        maxValue[a[next]] = max(maxValue[a[next]], solve(next, curr, a[curr]));
    }

    int ans;
    if(prevValue == INF || prevValue == -INF)
        ans = maxValue.size() * (maxValue.size() - 1) / 2;
    else
        ans = maxValue.size() * (maxValue.size() + 1) / 2;
    for(const auto& p : maxValue)
        ans += p.second;

    return memo[make_tuple(curr, prev, prevValue)] = ans;
}

int main()
{
    int n;
    cin >> n;
    a.resize(n);
    for(int i=0; i<n; ++i)
        cin >> a[i];

    edges.assign(n, vector<int>());
    for(int i=0; i<n-1; ++i){
        int x, y;
        cin >> x >> y;
        -- x;
        -- y;
        edges[x].push_back(y);
        edges[y].push_back(x);
    }

    int ans = 0;
    for(int i=0; i<n; ++i){
        ans = max(ans, solve(i, -1, -INF));
        ans = max(ans, solve(i, -1, INF));
    }
    cout << ans << endl;

    return 0;
}