#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;
const int MAXN = 1e5 + 10;
const int logn = 23;

int up[MAXN][logn], sum[MAXN][logn], cost[MAXN], tin[MAXN], tout[MAXN];
vector<int> g[MAXN];
int timer = 0;

// (sum]

void dfs(int v, int p) {
    if (p != v) up[v][0] = p;
    sum[v][0] = cost[p];
    for (int i = 1; i < logn; i++) {
        up[v][i] = up[up[v][i - 1]][i - 1];
        sum[v][i] = sum[v][i - 1] + sum[up[v][i - 1]][i - 1];
    }
    tin[v] = timer++;
    for (auto u : g[v]) {
        if (u != p) {
            dfs(u, v);
        }
    }
    tout[v] = timer;
}

bool ancestor(int u, int v) {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}

void ask() {
    int u, v;
    cin >> u >> v;
    u--;v--;
    if (u == v) {
        cout << cost[u] << "\n";
        return;
    }
    int ans = cost[u] + cost[v];
    if (ancestor(u, v) || ancestor(v, u)) {
        if (ancestor(v, u)) swap(u, v);
        for (int i = logn - 1; i >= 0; i--) {
            if (!ancestor(up[v][i], u)) {
                ans += sum[v][i];
                v = up[v][i];
            }
        }
    } else {
        for (int i = logn - 1; i >= 0; i--) {
            if (!ancestor(up[v][i], u)) {
                ans += sum[v][i];
                v = up[v][i];
            }
        }
        ans += sum[v][0];
        v = up[v][0];
        for (int i = logn - 1; i >= 0; i--) {
            if (!ancestor(up[u][i], v)) {
                ans += sum[u][i];
                u = up[u][i];
            }
        }
    }
    cout << ans << "\n";
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> cost[i];
    int a, b;
    for (int i = 1; i < n; i++) {
        cin >> a >> b;
        a--;b--;
        g[a].pb(b);
        g[b].pb(a);
    }
    dfs(0, 0);
//    for (int i = 0; i < n; i++) cout << tin[i] << " ";
//    cout << "\n";
//    for (int i = 0; i < n; i++) cout << tout[i] << " ";
//    cout << "\n";
    int q;
    cin >> q;
    while (q--) ask();
}
/*
5
1 10 100 1000 10000
1 2
2 3
3 4
3 5
10
1 2
*/