#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
  gn(x1, x2), gn(x3);
}
template <class T1, class T2, class T3, class T4>
inline void gn(T1 &x1, T2 &x2, T3 &x3, T4 &x4) {
  gn(x1, x2, x3), gn(x4);
}
template <class T1, class T2, class T3, class T4, class T5>
inline void gn(T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5) {
  gn(x1, x2, x3, x4), gn(x5);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
template <class T1, class T2, class T3, class T4>
inline void print(T1 x1, T2 x2, T3 x3, T4 x4) {
  printsp(x1), printsp(x2), printsp(x3), println(x4);
}
template <class T1, class T2, class T3, class T4, class T5>
inline void print(T1 x1, T2 x2, T3 x3, T4 x4, T5 x5) {
  printsp(x1), printsp(x2), printsp(x3), printsp(x4), println(x5);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int head[100010], nxt[200010], to[200010];
int E, sz[100010];
void init(int n) {
  E = 0;
  for (int i = 1; i <= n; i++) {
    head[i] = -1;
    sz[i] = 0;
  }
}
void add(int u, int v) {
  nxt[E] = head[u];
  to[E] = v;
  head[u] = E++;
  nxt[E] = head[v];
  to[E] = u;
  head[v] = E++;
}
int pa[100010][20], deep[100010];
struct LCA {
  void dfs(int u, int fa = 0) {
    pa[u][0] = fa;
    sz[u] = 1;
    deep[u] = deep[fa] + 1;
    for (int i = 1; i < 20; i++) pa[u][i] = pa[pa[u][i - 1]][i - 1];
    for (int e = head[u]; e != -1; e = nxt[e]) {
      int v = to[e];
      if (v == fa) continue;
      dfs(v, u);
      sz[u] += sz[v];
    }
  }
  int k_th(int u, int k) {
    for (int i = 0; i < 20; i++) {
      if (k & (1 << i)) u = pa[u][i];
    }
    return u;
  }
  int lca(int a, int b) {
    if (deep[a] > deep[b]) swap(a, b);
    b = k_th(b, deep[b] - deep[a]);
    if (a == b) return a;
    for (int i = 20; i--;) {
      if (pa[a][0] == pa[b][0]) break;
      if (pa[a][i] != pa[b][i]) a = pa[a][i], b = pa[b][i];
    }
    return pa[a][0];
  }
} lca;
int main() {
  int n;
  gn(n);
  init(n);
  for (int i = 1; i < n; i++) {
    int u, v;
    gn(u, v);
    add(u, v);
  }
  lca.dfs(1);
  int m;
  gn(m);
  while (m--) {
    int u, v;
    gn(u, v);
    int w = lca.lca(u, v);
    int len = deep[u] + deep[v] - deep[w] * 2;
    if (len & 1)
      puts("0");
    else {
      if (u == v)
        println(n);
      else if (deep[u] == deep[v]) {
        int a = lca.k_th(u, deep[u] - deep[w] - 1);
        int b = lca.k_th(v, deep[v] - deep[w] - 1);
        println(n - sz[a] - sz[b]);
      } else {
        if (deep[u] < deep[v]) swap(u, v);
        v = lca.k_th(u, len >> 1);
        u = lca.k_th(u, (len >> 1) - 1);
        println(sz[v] - sz[u]);
      }
    }
  }
}
