#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)1e18;
const long long mod = (long long)1e9 + 7;
const double pi = acos(-1.0);
const double eps = (double)1e-9;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
const int N = 200500;
const int block = 450;
long long cur, ans[N];
bool pol[N], u[N];
vector<int> g[N];
int timer, tin[N], tout[N], eu[N];
int n, q, f[N], ar[N], up[N][17], cnt1[N], cnt2[N];
void dfs(int v, int pr = -1) {
  tin[v] = ++timer;
  eu[timer] = v;
  for (auto to : g[v]) {
    if (to == pr) continue;
    up[to][0] = v;
    dfs(to, v);
  }
  tout[v] = ++timer;
  eu[timer] = v;
}
inline bool upper(int x, int y) {
  return (tin[x] <= tin[y] && tout[y] <= tout[x]);
}
inline int lca(int x, int y) {
  if (upper(x, y)) return x;
  if (upper(y, x)) return y;
  for (int i = 16; i >= 0; i--)
    if (up[x][i] && !upper(up[x][i], y)) x = up[x][i];
  return up[x][0];
}
struct query {
  int l, r, bl, lca, id;
  query(){};
  query(int a, int b, int c, int d, int e) {
    l = a;
    r = b;
    bl = c;
    lca = d;
    id = e;
  }
} qr[N];
inline bool cmp(query q1, query q2) {
  if (q1.bl == q2.bl) return q1.r < q2.r;
  return q1.bl < q2.bl;
}
inline void add(int v) {
  if (pol[v]) {
    cur += cnt2[f[v]];
    cnt1[f[v]]++;
  } else {
    cur += cnt1[f[v]];
    cnt2[f[v]]++;
  }
}
inline void del(int v) {
  if (pol[v]) {
    cur -= cnt2[f[v]];
    cnt1[f[v]]--;
  } else {
    cur -= cnt1[f[v]];
    cnt2[f[v]]--;
  }
}
inline void upd(int i) {
  int v = eu[i];
  if (!u[v])
    add(v);
  else
    del(v);
  u[v] ^= 1;
}
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> pol[i];
  for (int i = 1; i <= n; i++) {
    cin >> f[i];
    ar[i] = f[i];
  }
  sort(ar + 1, ar + 1 + n);
  int sz = unique(ar + 1, ar + 1 + n) - ar - 1;
  for (int i = 1; i <= n; i++)
    f[i] = lower_bound(ar + 1, ar + 1 + sz, f[i]) - ar;
  for (int i = 1; i < n; i++) {
    int x, y;
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  dfs(1);
  for (int j = 1; j <= 16; j++)
    for (int i = 1; i <= n; i++) up[i][j] = up[up[i][j - 1]][j - 1];
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int x, y;
    cin >> x >> y;
    if (tin[x] > tin[y]) swap(x, y);
    if (upper(x, y))
      qr[i] = query(tin[x], tin[y], tin[x] / block, lca(x, y), i);
    else
      qr[i] = query(tout[x], tin[y], tout[x] / block, lca(x, y), i);
  }
  sort(qr + 1, qr + 1 + q, &cmp);
  int l = qr[1].l, r = qr[1].l - 1;
  for (int i = 1; i <= q; i++) {
    int L = qr[i].l;
    int R = qr[i].r;
    while (L < l) upd(--l);
    while (l < L) upd(l++);
    while (r < R) upd(++r);
    while (R < r) upd(r--);
    if (eu[qr[i].l] != qr[i].lca) upd(tin[qr[i].lca]);
    ans[qr[i].id] = cur;
    if (eu[qr[i].l] != qr[i].lca) upd(tin[qr[i].lca]);
  }
  for (int i = 1; i <= q; i++) cout << ans[i] << endl;
  return 0;
}
