#include<iostream>
#include<vector>

using namespace std;

int paren[50001] = { 0, };
vector<vector<int>> vec(50001);

void sortParen(int parent){
  vector<int> tmp;
  for(int i = 0; i<vec[parent].size(); i++){
    if(!paren[(vec[parent])[i]]){
      tmp.push_back((vec[parent])[i]);
      paren[(vec[parent])[i]] = parent;
    }
  }
  for(int i = 0; i<tmp.size(); i++){
    sortParen(tmp[i]);
  }
}

int main(){
  int N;
  cin>>N;
  for(int i = 0; i<N-1; i++){
    int tmp1, tmp2;
    scanf("%d %d", &tmp1, &tmp2);
    vec[tmp1].push_back(tmp2);
    vec[tmp2].push_back(tmp1);
  }
  paren[1] = -1;
  sortParen(1);

  int M;
  cin>>M;
  for(int i = 0; i<M; i++){
    int m1, m2;
    vector<int> vec1;
    scanf("%d %d", &m1, &m2);
    while(m1 != -1){
      vec1.push_back(m1);
      m1 = paren[m1];
    }
    bool conti = true;
    while(m2 != -1 && conti){
      for(int i = 0; i<vec1.size(); i++){
        if(vec1[i] == m2){
          cout<<m2 <<endl;
          conti = false;
          break;
        }
      }
      m2 = paren[m2];
    }
  }
}

#include <cstdio>
#include <vector>
int a[50001] = { 0, }, d[50001];
std::vector<std::pair<int, int>> temp;

int find(int x, int y) {
	while (d[x]>d[y]) x = a[x];
	while (d[x]<d[y]) y = a[y];

	while (x != y)
	{
		x = a[x];
		y = a[y];
	}
	return x;
}

int main() {
	int n;
	scanf("%d", &n);
	a[1] = -1, d[1] = 0;
	for (int i = 1; i < n; i++) {
		int x, y;
		scanf("%d %d", &x, &y);
		if (a[x] == 0 && a[y] == 0)
			temp.push_back(std::pair<int, int>(x, y));
		else if (a[x] == 0) {
			a[x] = y;
			d[x] = d[y] + 1;
		}
		else {
			a[y] = x;
			d[y] = d[x] + 1;
		}
	}

	while (!temp.empty()) {
		for (int i = 0; i < temp.size(); i++) {
			int x = temp[i].first, y = temp[i].second;
			if (a[y] != 0) {
				a[x] = y;
				d[x] = d[y] + 1;
				temp.erase(temp.begin() + i);
				i--;
			}
			else if (a[x] != 0) {
				a[y] = x;
				d[y] = d[x] + 1;
				temp.erase(temp.begin() + i);
				i--;
			}
		}
	}

	int m;
	scanf("%d", &m);
	for (int i = 0; i < m; i++) {
		int t1, t2;
		scanf("%d %d", &t1, &t2);
		printf("%d\n", find(t1, t2));
	}
	return 0;
}