#include <bits/stdc++.h>
const double Pi = acos(-1.0);
using namespace std;
const int maxN = 100005;
int n;
int boy[maxN], f[maxN], uf[maxN];
vector<int> G[maxN];
int disc[maxN << 1], st[maxN], fin[maxN], t;
int depth[maxN], par[maxN][18];
void dfs(int cur, int pre) {
  st[cur] = ++t;
  disc[t] = cur;
  par[cur][0] = pre;
  for (int i = 1; i < 18; i++) par[cur][i] = par[par[cur][i - 1]][i - 1];
  for (int i = 0; i < (int)G[cur].size(); i++) {
    int nxt = G[cur][i];
    if (nxt != pre) {
      depth[nxt] = depth[cur] + 1;
      dfs(nxt, cur);
    }
  }
  fin[cur] = ++t;
  disc[t] = cur;
}
int lca(int x, int y) {
  if (depth[x] > depth[y]) swap(x, y);
  for (int i = 17; i >= 0; i--) {
    if (depth[par[y][i]] >= depth[x]) y = par[y][i];
  }
  if (x == y) return x;
  for (int i = 17; i >= 0; i--) {
    if (par[x][i] != par[y][i]) {
      x = par[x][i];
      y = par[y][i];
    }
  }
  return par[x][0];
}
int q, sq;
struct query {
  int l, r, i, blk, L;
};
bool cmp(const query &a, const query &b) {
  return (a.blk != b.blk) ? a.blk < b.blk : a.r < b.r;
}
query Q[maxN];
long long cnt[2][maxN];
bool vis[maxN];
long long ans[maxN], cur;
void update(int di) {
  if (di == -1) return;
  int i = disc[di], s = boy[i];
  if (vis[i]) {
    cnt[s][f[i]]--;
    cur -= cnt[s ^ 1][f[i]];
  } else {
    cur += cnt[s ^ 1][f[i]];
    cnt[s][f[i]]++;
  }
  vis[i] ^= 1;
}
int main(int argc, char **argv) {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &boy[i]);
  for (int i = 0; i < n; i++) {
    scanf("%d", &f[i]);
    uf[i] = f[i];
  }
  sort(uf, uf + n);
  int sz = unique(uf, uf + n) - uf;
  for (int i = 0; i < n; i++) f[i] = lower_bound(uf, uf + sz, f[i]) - uf;
  int a, b;
  for (int i = 1; i < n; i++) {
    scanf("%d %d", &a, &b);
    a--;
    b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  dfs(0, 0);
  scanf("%d", &q);
  sq = (int)sqrt(t);
  int l, r;
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &l, &r);
    l--;
    r--;
    if (st[l] > st[r]) swap(l, r);
    int x = lca(l, r);
    Q[i].i = i;
    if (x == l) {
      Q[i].l = st[l];
      Q[i].r = st[r];
      Q[i].blk = Q[i].l / sq;
      Q[i].L = -1;
    } else {
      Q[i].l = fin[l];
      Q[i].r = st[r];
      Q[i].blk = Q[i].l / sq;
      Q[i].L = st[x];
    }
  }
  sort(Q, Q + q, cmp);
  int ql = 1, qr = 0;
  for (int i = 0; i < q; i++) {
    int li = Q[i].l, ri = Q[i].r;
    while (ql < li) update(ql++);
    while (ql > li) update(--ql);
    while (qr < ri) update(++qr);
    while (qr > ri) update(qr--);
    update(Q[i].L);
    ans[Q[i].i] = cur;
    update(Q[i].L);
  }
  for (int i = 0; i < q; i++) printf("%lld\n", ans[i]);
  return 0;
}
