#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
struct seg
{
int l,r,c;
bool operator<(const seg& other)
{
return r<other.r;
}
};
const int sqr = 500;
int A[100001];
vi graph[100001];
ll query_ans[2001];
vector<pair<ll,pii>> lp_pairs[200003];
vector<pair<ll,pii>> lp_pairs2[200003];
ll norm_pair_cnt[200003];
ll norm_pair_cnt2[200003];
int n,m;
vector<seg> segs;
vi queries;
vector<seg> blocks[400001/sqr+3];
int L = 1, R = 1;
void move_R(int p, ll x)
{
if(p == 0) return;
if(p >= 0)
{
norm_pair_cnt[R+1]+=x;
norm_pair_cnt[R+1+p]-=x;
lp_pairs[L].pb({-x,{R+1,R+p}});
}
else
{
norm_pair_cnt[R+p+1]-=x;
norm_pair_cnt[R+1]+=x;
lp_pairs[L].pb({x,{R+p+1,R}});
}
R += p;
}
void move_L(int p, ll x)
{
if(p == 0) return;
if(p >= 0)
{
norm_pair_cnt2[L]+=x;
norm_pair_cnt2[L+p]-=x;
lp_pairs2[R].pb({-x,{L,L+p-1}});
}
else
{
norm_pair_cnt2[L+p]-=x;
norm_pair_cnt2[L]+=x;
lp_pairs2[R].pb({x,{L+p,L-1}});
}
L += p;
}
vector<pii> arr;
ll P_sum[200001];
int pre[100001];
int maxpre[100001];
int cur_pre = 0;
int jump[100001][17];
int in_cnt[100001];
int out_cnt[100001];
void dfs(int v, int pop)
{
in_cnt[v] = siz(arr);
arr.pb({A[v],1});
jump[v][0] = pop;
pre[v] = cur_pre++;
maxpre[v] = pre[v];
forall(it,graph[v]) if(it != pop)
{
dfs(it,v);
maxpre[v] = maxpre[it];
}
out_cnt[v] = siz(arr);
arr.pb({A[v],-1});
}
pair<int,pii> lca(int a, int b)
{
if(pre[b] >= pre[a] && pre[b] <= maxpre[a]) return {a,{-1,-1}};
if(pre[a] >= pre[b] && pre[a] <= maxpre[b]) return {b,{-1,-1}};
for(int bit = 16; bit >= 0; bit--)
{
int new_a = jump[a][bit];
if(!(pre[b] >= pre[new_a] && pre[b] <= maxpre[new_a])) a = new_a;
}
for(int bit = 16; bit >= 0; bit--)
{
int new_b = jump[b][bit];
if(!(pre[a] >= pre[new_b] && pre[a] <= maxpre[new_b])) b = new_b;
}
return {jump[a][0],{a,b}};
}
ll ans2[200001];
const int tree_siz = 1024*512-1;
int sum_[tree_siz+1];
int get_sum(int akt, int p1, int p2, int s1, int s2)
{
if(p2 < s1 || p1 > s2) return 0;
if(p1 >= s1 && p2 <= s2) return sum_[akt];
return get_sum(akt*2,p1,(p1+p2)/2,s1,s2)+get_sum(akt*2+1,(p1+p2)/2+1,p2,s1,s2);
}
void change(int p, int x)
{
int v = tree_siz/2+1+p;
while(v != 1)
{
sum_[v] += x;
v /= 2;
}
sum_[v] += x;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
cin >> n;
arr = {{0,0}};
rep2(i,1,n) cin >> A[i];
rep(i,n-1)
{
int a,b;
cin >> a >> b;
graph[a].pb(b);
graph[b].pb(a);
}
dfs(1,1);
rep2(bit,1,16) rep2(i,1,n) jump[i][bit] = jump[jump[i][bit-1]][bit-1];
int m;
cin >> m;
rep(i,m)
{
int s,t;
cin >> s >> t;
if(pre[s] > pre[t]) swap(s,t);
pair<int,pii> x = lca(s,t);
if(x.ss.ff == -1) segs.pb({in_cnt[s],in_cnt[t],1});
else
{
segs.pb({out_cnt[s],in_cnt[t],-1});
segs.pb({in_cnt[x.ff],in_cnt[s],1});
segs.pb({in_cnt[x.ff],in_cnt[t],1});
segs.pb({in_cnt[x.ss.ff],in_cnt[s],1});
segs.pb({in_cnt[x.ss.ss],in_cnt[t],1});
}
}
ll segs_sum = 0;
int max_b = 0;
forall(it,segs)
{
segs_sum += it.c;
blocks[(it.l-1)/sqr].pb(it);
max_b = max(max_b,it.l/sqr);
}
rep(b,max_b+1)
{
int new_L = b*sqr+1;
int new_R = new_L;
move_R(new_R-R,segs_sum);
move_L(new_L-L,segs_sum);
sort(all(blocks[b]));
forall(it,blocks[b])
{
move_R(it.r-R,segs_sum);
move_L(it.l-L,segs_sum);
segs_sum -= it.c;
move_L(new_L-L,segs_sum);
}
}
rep2(i,1,200000) norm_pair_cnt[i] += norm_pair_cnt[i-1];
rep2(i,1,200000) norm_pair_cnt2[i] += norm_pair_cnt2[i-1];
int q;
cin >> q;
rep(qq,q)
{
int x;
cin >> x;
queries.pb(x);
}
for(int i = siz(arr)-1; i >= 1; i--)
{
forall(it,lp_pairs2[i]) rep2(j,it.ss.ff,it.ss.ss) P_sum[arr[j].ff] += arr[j].ss*it.ff;
P_sum[arr[i].ff] += arr[i].ss*norm_pair_cnt2[i];
rep(j,siz(queries)) if(queries[j]-arr[i].ff >= 0) query_ans[j] += arr[i].ss*P_sum[queries[j]-arr[i].ff];
P_sum[arr[i].ff] += arr[i].ss*norm_pair_cnt[i];
forall(it,lp_pairs[i]) rep2(j,it.ss.ff,it.ss.ss) P_sum[arr[j].ff] += arr[j].ss*it.ff;
}
sort(all(segs));
reverse(all(segs));
int p1 = 0;
vector<pii> pom;
rep2(i,1,n) pom.pb({out_cnt[i],i});
sort(all(pom));
reverse(all(pom));
forall(it,pom)
{
while(p1 < siz(segs) && segs[p1].r >= it.ff)
{
change(segs[p1].l,segs[p1].c);
p1++;
}
ans2[A[it.ss]*2] += get_sum(1,0,tree_siz/2,0,in_cnt[it.ss]);
}
rep(qq,q) cout << query_ans[qq]+ans2[queries[qq]] << "\n";
}
