lca2.py

from re import L
import sys
input = sys.stdin.readline
sys.setrecursionlimit(int(1e5))
LOG = 21

n = int(input())

parent = [[0] * LOG for _ in range(n + 1)]
d = [0] * (n + 1)
c = [0] * (n + 1)
graph = [[] for _ in range(n + 1)]

for _ in range(n - 1):
    a, b = map(int, input().split())
    graph[a].append(b)

def dfs(x, depth):
    c[x] = True
    d[x] = depth
    for y in graph[x]:
        if c[y]:
            continue
        else:
            parent[y][0] = x
            dfs(y, depth + 1)

def set_parent():
    dfs(1, 0)
    
    for i in range(1, LOG):
        for j in range(1, n + 1):
            parent[j][i] = parent[parent[j][i - 1]][i - 1]

def lca(a, b):
    if d[a] > d[b]:
        a, b = b, a
    
    for i in range(LOG - 1, -1, -1):
        if d[b] - d[a] >= (1<<i):
            b = parent[b][i]

    if a == b:
        return a
    for i in range(LOG - 1, -1, -1):
        if parent[a][i] != parent[b][i]:
            a = parent[a][i]
            b = parent[b][i]

    return parent[a][0]

def solve():
    set_parent()
    m = int(input())

    for i in range(m):
        a, b = map(int, input().split())
        print(lca(a, b))

solve()