#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int tot, cnt;
long long sum = 0;
long long ans[N];
int sex[N], v[N], dfn[N][2], tmp[N], fir[N], dep[N], f[N][22], turn[N], vis[N],
    pri[2][N], pos[N];
struct edge {
  int to;
  int nxt;
} e[2 * N];
struct query {
  int l, r, id;
  int lca;
} que[N];
inline void add(int x, int y) {
  e[++tot].to = y;
  e[tot].nxt = fir[x];
  fir[x] = tot;
  e[++tot].to = x;
  e[tot].nxt = fir[y];
  fir[y] = tot;
}
inline void dfs(int p) {
  dfn[p][0] = ++cnt;
  turn[cnt] = p;
  for (int i = fir[p]; i; i = e[i].nxt) {
    int q = e[i].to;
    if (q == f[p][0]) continue;
    f[q][0] = p, dep[q] = dep[p] + 1;
    for (int j = 1; j <= log2(dep[q]); j++) f[q][j] = f[f[q][j - 1]][j - 1];
    dfs(q);
  }
  dfn[p][1] = ++cnt;
  turn[cnt] = p;
}
inline int get_lca(int x, int y) {
  if (dep[x] < dep[y]) swap(x, y);
  for (int i = log2(dep[x]); i >= 0; i--)
    if (dep[f[x][i]] >= dep[y]) x = f[x][i];
  if (x == y) return x;
  for (int i = log2(dep[x]); i >= 0; i--)
    if (f[x][i] != f[y][i]) x = f[x][i], y = f[y][i];
  return f[x][0];
}
inline bool cmp(query x, query y) {
  if (pos[x.l] == pos[y.l])
    return x.r < y.r;
  else
    return pos[x.l] < pos[y.l];
}
inline void Ins(int p) {
  sum += pri[sex[p] ^ 1][v[p]];
  pri[sex[p]][v[p]]++;
}
inline void Del(int p) {
  pri[sex[p]][v[p]]--;
  sum -= pri[sex[p] ^ 1][v[p]];
}
inline void update(int i) {
  if (vis[turn[i]])
    Del(turn[i]);
  else
    Ins(turn[i]);
  vis[turn[i]] ^= 1;
}
int main() {
  int n, m, a, b;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &sex[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &v[i]), tmp[i] = v[i];
  sort(tmp + 1, tmp + n + 1);
  int newn = unique(tmp + 1, tmp + n + 1) - (tmp + 1);
  for (int i = 1; i <= n; i++)
    v[i] = lower_bound(tmp + 1, tmp + newn + 1, v[i]) - tmp;
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &a, &b);
    add(a, b);
  }
  dep[1] = 1, dfs(1);
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    que[i].id = i;
    scanf("%d%d", &a, &b);
    if (dfn[a][0] > dfn[b][0]) swap(a, b);
    if (dfn[a][1] > dfn[b][1])
      que[i].l = dfn[a][0], que[i].r = dfn[b][0], que[i].lca = -1;
    else
      que[i].l = dfn[a][1], que[i].r = dfn[b][0], que[i].lca = get_lca(a, b);
  }
  int len = sqrt(2 * n);
  for (int i = 1; i <= 2 * n; i++) pos[i] = (i - 1) / len + 1;
  sort(que + 1, que + m + 1, cmp);
  int head = 1, tail = 0;
  for (int i = 1; i <= m; i++) {
    while (head > que[i].l) update(--head);
    while (tail < que[i].r) update(++tail);
    while (head < que[i].l) update(head++);
    while (tail > que[i].r) update(tail--);
    ans[que[i].id] = sum;
    if (que[i].lca != -1)
      ans[que[i].id] += pri[sex[que[i].lca] ^ 1][v[que[i].lca]];
  }
  for (int i = 1; i <= m; i++) printf("%lld\n", ans[i]);
  return 0;
}
