#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


struct Heap {
  Heap *l, *r;
  Int val;
  Heap(Int val_ = 0) : l(nullptr), r(nullptr), val(val_) {}
};
// max heap
Heap *merge(Heap *a, Heap *b) {
  if (!a) return b;
  if (!b) return a;
  if (a->val < b->val) swap(a, b);
  a->r = merge(a->r, b);
  swap(a->l, a->r);
  return a;
}
void pop(Heap *&a) {
  a = merge(a->l, a->r);
}


int N;
vector<Int> C;
vector<int> A, B;

vector<vector<int>> graph;

// * > * > * > * [> * < *]
Int bad;
vector<Heap> nodes;
Heap *solve(int u, int p) {
  Heap *ret = nullptr;
  for (const int v : graph[u]) if (p != v) {
    Heap *res = solve(v, u);
    ret = merge(ret, res);
  }
  Int c = C[u];
  for (; ; ) {
    if (ret && c <= ret->val) {
      const Int x1 = ret->val; pop(ret);
      if (ret) {
        const Int x2 = ret->val; pop(ret);
        c = c - x1 + x2;
      } else {
        bad += (c - x1);
        break;
      }
    } else {
      nodes[u] = Heap(c);
      ret = merge(ret, &nodes[u]);
      break;
    }
  }
  return ret;
}

int main() {
  for (; ~scanf("%d", &N); ) {
    C.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%lld", &C[u]);
    }
    A.resize(N - 1);
    B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    
    graph.assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      graph[A[i]].push_back(B[i]);
      graph[B[i]].push_back(A[i]);
    }
    bad = 0;
    nodes.resize(N);
    Heap *res = solve(0, -1);
    Int ans = 0;
    Int sig = +1;
    for (; res; ) {
      const Int x = res->val; pop(res);
      ans += sig * x;
      sig = -sig;
    }
    ans += sig * bad;
    
    Int sumC = 0;
    for (int i = 0; i < N; ++i) {
      sumC += C[i];
    }
    ans = (sumC + ans) / 2;
    printf("%lld\n", ans);
  }
  return 0;
}