import sys
sys.setrecursionlimit(10000000)
class SegmentTree():
def __init__(self, n):
self.size = 1
while self.size < n:
self.size *= 2
self.node = [0]*(2*self.size - 1)
self.node_index = [0]*(2*self.size - 1)
for i in range(self.size):
ind = i + (self.size - 1)
self.node_index[ind] = i
while ind > 0:
ind = (ind - 1) // 2
self.node_index[ind] = self.node_index[2*ind+1]
def update(self, i, val):
i += (self.size - 1)
self.node[i] = val
while i > 0:
i = (i - 1) // 2
if self.node[2*i+1] <= self.node[2*i+2]:
self.node[i] = self.node[2*i+1]
self.node_index[i] = self.node_index[2*i+1]
else:
self.node[i] = self.node[2*i+2]
self.node_index[i] = self.node_index[2*i+2]
def get_min(self, begin, end, k=0, l=0, r=-1):
begin += (self.size - 1)
end += (self.size - 1)
res = float("inf")
res_index = 0
while begin < end:
if (end - 1) & 1:
end -= 1
if res > self.node[end]:
res = self.node[end]
res_index = self.node_index[end]
elif res == self.node[end]:
res_index = min(res_index, self.node_index[end])
if (begin - 1) & 1:
if res > self.node[begin]:
res = self.node[begin]
res_index = self.node_index[begin]
elif res == self.node[begin]:
res_index = min(res_index, self.node_index[begin])
begin += 1
begin = (begin - 1) // 2
end = (end - 1) // 2
return res_index, res
def dfs(node, parent_node, dep):
id[node] = k[0]
vs[k[0]] = node
depth[k[0]] = dep
k[0] += 1
for child_node in tree[node]:
if parent_node != child_node:
dfs(child_node, node, dep+1)
vs[k[0]] = node
depth[k[0]] = dep
k[0] += 1
n = int(input())
tree = [[] for i in range(n)]
for i in range(n-1):
node1, node2 = map(int, input().split())
tree[node1-1].append(node2-1)
tree[node2-1].append(node1-1)
k = [0]
id = [0]*n
depth = [0]*(2*n-1)
vs = [0]*(2*n-1)
dfs(0,-1,0)
st = SegmentTree(2*n-1)
for i in range(2*n-1):
st.update(i, depth[i])
q = int(input())
info = [list(map(int, input().split())) for i in range(q)]
#print(vs)
#print(depth)
#print(id)
#print(st.node)
#print(st.node_index)
for i in range(q):
begin = min(id[info[i][0]-1], id[info[i][1]-1])
end = max(id[info[i][0]-1], id[info[i][1]-1]) + 1
lca = vs[st.get_min(begin, end)[0]]
print(depth[id[info[i][0]-1]] + depth[id[info[i][1]-1]] - 2*depth[id[lca]] + 1)