#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}


template<typename F>
struct FixPoint : F{
  FixPoint(F&& f):F(forward<F>(f)){}
  template<typename... Args>
  decltype(auto) operator()(Args&&... args) const{
    return F::operator()(*this,forward<Args>(args)...);
  }
};
template<typename F>
inline decltype(auto) MFP(F&& f){
  return FixPoint<F>{forward<F>(f)};
}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n;
  cin>>n;
  vector<vector<int>> G(n);
  for(int i=1;i<n;i++){
    int a,b;
    cin>>a>>b;
    a--;b--;
    G[a].emplace_back(b);
    G[b].emplace_back(a);
  }

  vector<int> idx(n);
  for(int i=0;i<n;i++) idx[i]=i;

  int q;
  cin>>q;

  int x=0;
  for(int i=0;i<q;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    u=(u+x)%n;v=(v+x)%n;
    swap(idx[u],idx[v]);
    MFP([&](auto dfs,int v,int p)->void{
      int nxt=-1;
      for(int u:G[v]){
        if(u==p) continue;
        if(nxt<0 or idx[nxt]<idx[u]) nxt=u;
      }
      if(~nxt) dfs(nxt,v);
      else cout<<(x=v+1)<<newl;
    })(u,-1);
  }

  return 0;
}