#include #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; using ll = long long; const ll mod = 998244353; #define fi first #define se second #define rep(i,n) for(ll i=0;i>; struct LCA{ vector> par; vector dis; LCA(const Graph &G,ll root=0){init (G,root);} void init(const Graph &G,ll root=0){ ll v=G.size(); ll k=1; while((1<(v,-1)); dis.assign(v,-1); dfs(G,root,-1,0); for(ll i=0;i+1>k&1){ u=par[k][u]; } } if(u==v) return u; for(ll k=K-1;k>=0;k--){ if(par[k][u]!=par[k][v]){ u=par[k][u]; v=par[k][v]; } } return par[0][u]; } ll get_dis(ll u,ll v){return dis[u]+dis[v]-2*dis[query(u,v)];} }; ll f(ll x,ll y){ if(x<=y) return 1; return 1-f(y,(x-y+1)/2); } int main() { ll N; cin >> N; Graph G(N); rep(i,N-1){ ll u,v; cin >> u >> v; u--,v--; G[u].push_back(v); G[v].push_back(u); } LCA lca(G); ll Q; cin >> Q; while(Q--){ ll a,b; cin >> a >> b; a--,b--; ll q=lca.query(a,b); ll dis_a=lca.dis[a]-lca.dis[q]; ll dis_b=lca.dis[b]-lca.dis[q]; ll ans=f(dis_a,dis_b); if(ans){ cout << "Alice" << endl; }else{ cout << "Bob" << endl; } } return 0; }