#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
inline int read() {
  int num = 0, w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) {
    num = (num << 3) + (num << 1) + (ch ^ 48);
    ch = getchar();
  }
  return w ? -num : num;
}
struct edge {
  int v, next;
} ES[maxn];
int EC = 0;
int Next[maxn];
inline void add_edge(int x, int y) {
  ES[++EC] = {y, Next[x]};
  Next[x] = EC;
}
stack<int> stk;
int dfn[maxn], fa[maxn][20], belong[maxn], block, id;
int n, m, q, u, v;
int a[maxn], vis[maxn], b[maxn], c[2][maxn], vis2[maxn];
long long ans, Ans[maxn];
void dfs(int x) {
  dfn[x] = dfn[fa[x][0]] + 1;
  for (int i = 1; 1 << i <= dfn[x]; i++) fa[x][i] = fa[fa[x][i - 1]][i - 1];
  size_t now = stk.size();
  for (int i = Next[x]; i; i = ES[i].next) {
    int v = ES[i].v;
    if (v == fa[x][0]) continue;
    fa[v][0] = x;
    dfs(v);
    if (stk.size() - now > block) {
      id++;
      while (stk.size() > now) belong[stk.top()] = id, stk.pop();
    }
  }
  stk.push(x);
  if (x == 1) {
    id++;
    while (!stk.empty()) belong[stk.top()] = id, stk.pop();
  }
}
int lca(int x, int y) {
  if (dfn[x] < dfn[y]) swap(x, y);
  for (int i = 20; i >= 0; i--)
    if ((1 << i) <= dfn[x] - dfn[y]) x = fa[x][i];
  if (x == y) return x;
  for (int i = 20; i >= 0; i--) {
    if (dfn[x] >= (1 << i) && fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
  }
  return fa[x][0];
}
struct query {
  int x, y, id;
  bool operator<(const query &b) const {
    if (belong[x] != belong[b.x]) return belong[x] < belong[b.x];
    return belong[y] < belong[b.y];
  }
} qq[maxn];
void add_pos(int u) {
  if (vis[u])
    ans += c[!vis[u]][a[u]], c[vis[u]][a[u]]++;
  else
    ans += c[!vis[u]][a[u]], c[vis[u]][a[u]]++;
}
void del_pos(int u) {
  if (vis[u])
    ans -= c[!vis[u]][a[u]], c[vis[u]][a[u]]--;
  else
    ans -= c[!vis[u]][a[u]], c[vis[u]][a[u]]--;
}
void invert(int u) {
  if (vis2[u])
    vis2[u] = 0, del_pos(u);
  else
    vis2[u] = 1, add_pos(u);
}
inline void mark(int u, int l) {
  for (int x = u; x != l; x = fa[x][0]) invert(x);
}
int main() {
  n = read();
  block = (int)(pow(n, 2.0 / 3) / 2);
  for (int i = 1; i <= n; i++) vis[i] = read();
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    b[i] = a[i];
  }
  sort(b + 1, b + n + 1);
  int num = unique(b + 1, b + n + 1) - b;
  for (int i = 1; i <= n; i++) a[i] = lower_bound(b + 1, b + num + 1, a[i]) - b;
  for (int i = 0; i < n - 1; i++) {
    u = read(), v = read();
    add_edge(u, v);
    add_edge(v, u);
  }
  dfs(1);
  q = read();
  for (int i = 0; i < q; i++) {
    qq[i].x = read(), qq[i].y = read();
    if (belong[qq[i].x] > belong[qq[i].y]) swap(qq[i].x, qq[i].y);
    qq[i].id = i;
  }
  sort(qq, qq + q);
  int x = 1, y = 1;
  ans = 0;
  for (int i = 0; i < q; i++) {
    const query &temp = qq[i];
    int l = lca(temp.x, x), l2 = lca(temp.y, y);
    mark(x, l), mark(temp.x, l), mark(y, l2), mark(temp.y, l2);
    x = temp.x, y = temp.y;
    l = lca(temp.x, temp.y);
    invert(l);
    Ans[temp.id] = ans;
    invert(l);
  }
  for (int i = 0; i < q; i++) printf("%lld\n", Ans[i]);
  return 0;
}
