1
#include <cstdio>
2
#include <cstring>
3
#include <algorithm>
4
using namespace std;
5
struct edge
6
{
7
    int END, next;
8
} v[200005];
9
int first[100005], p, n;
10
void add(int a, int b)
11
{
12
    v[p].END = b;
13
    v[p].next = first[a];
14
    first[a] = p++;
15
}
16
int size[100005];
17
int f[100005][30];
18
int dep[100005];
19
void dfs(int rt, int fa, int dp)
20
{
21
    dep[rt] = dp;
22
    f[rt][0] = fa;
23
    for (int i = 1; i <= 20; i++)
24
        f[rt][i] = f[f[rt][i - 1]][i - 1];
25
    size[rt] = 1;
26
    for (int i = first[rt]; i != -1; i = v[i].next)
27
        if (v[i].END != fa)
28
        {
29
            dfs(v[i].END, rt, dp + 1);
30
            size[rt] += size[v[i].END];
31
        }
32
}
33
int LCA(int a, int b)
34
{
35
    if (dep[a] < dep[b])
36
        swap(a, b);
37
    int t = dep[a] - dep[b];
38
    for (int i = 20; i >= 0; i--)
39
        if (t & (1 << i))
40
            a = f[a][i];
41
    if (a == b)
42
        return a;
43
    for (int i = 20; i >= 0; i--)
44
        if (f[a][i] != f[b][i])
45
            a = f[a][i], b = f[b][i];
46
    return f[a][0];
47
}
48
int Query(int a, int b)
49
{
50
    if (a == b)
51
        return n;
52
    if (dep[a] < dep[b])
53
        swap(a, b);
54
    int Lca = LCA(a, b);
55
    int l = dep[a] - dep[Lca];
56
    int r = dep[b] - dep[Lca];
57
    if ((l + r) & 1)
58
        return 0;
59
    int mid = l + r >> 1;
60
    int k = a;
61
    for (int i = 20; i >= 0; i--)
62
        if (mid & (1 << i))
63
            k = f[k][i];
64
    if (k == Lca)
65
    {
66
        int t = dep[a] - dep[Lca] - 1;
67
        for (int i = 20; i >= 0; i--)
68
            if (t & (1 << i))
69
                a = f[a][i], b = f[b][i];
70
        return n - size[a] - size[b];
71
    }
72
    else
73
    {
74
        int t = dep[a] - dep[k] - 1;
75
        for (int i = 20; i >= 0; i--)
76
            if (t & (1 << i))
77
                a = f[a][i];
78
        return size[k] - size[a];
79
    }
80
}
81
int main(int argc, char const *argv[])
82
{
83
    memset(first,-1,sizeof(first));
84
    int a, b;
85
    scanf("%d", &n);
86
    for (int i = 1; i < n; i++)
87
    {
88
        scanf("%d%d", &a, &b);
89
        add(a, b);
90
        add(b, a);
91
    }
92
    dfs(1, 0, 0);
93
    int m;
94
    scanf("%d",&m);
95
    for (int i = 1; i <= m; i++)
96
    {
97
        scanf("%d%d", &a, &b);
98
        printf("%d\n", Query(a, b));
99
    }
100
    return 0;
101
}