#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

typedef long long ll;
const int N = 1e5 + 5;
vector<ll> tree[N];
int n;
ll w[N];

int main()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)scanf("%lld", &w[i]);
    int x, y;
    for(int i = 1; i < n; i++)
    {
        scanf("%d %d", &x, &y);
        tree[x].push_back(w[y]);
        tree[y].push_back(w[x]);
    }
    for(int i = 1; i <= n; i++)sort(tree[i].begin(), tree[i].end());

    double ans = -0x7f7f7f7f;
    for(int i = 1; i <= n; i++)
    {
        double tmp1 = 0, tmp2 = 0;
        tmp1 = (1.0 * w[i] + tree[i][tree[i].size() - 1]) / 2.0;
        if(tree[i].size() > 3)
            tmp2 = (1.0 * w[i] + tree[i][tree[i].size() - 1] + tree[i][tree[i].size() - 2]) / 3.0;
        ans = max(ans, tmp1);
        ans = max(ans, tmp2);
    }
    for(int i = 1; i <= n; i++)
    {
        double tmp1 = 0, tmp2 = 0x7f7f7f7f;
        tmp1 = (1.0 * w[i] + tree[i][0]) / 2.0;
        if(tree[i].size() > 3)
            tmp2 = (1.0 * w[i] + tree[i][0] + tree[i][1]) / 3.0;
        ans = max(ans, -tmp1);
        ans = max(ans, -tmp2);
    }
    ans = ans * ans / 4.0;
    printf("%.6lf\n", ans);
    //while(1);
    return 0;
}