倍增版:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<queue>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int MAXN=500005;
int n,m,s,last[MAXN],len=0,dep[MAXN],max_step,fa[MAXN][50];
bool vis[MAXN];
struct Node{
int to,val,next;
Node(int to=0,int val=0,int next=0):to(to),val(val),next(next){}
}e[MAXN*2];
void add(int from,int to,int val){
e[++len]=Node(to,val,last[from]); last[from]=len;
}
void Swap(int &x,int &y){
x^=y;y^=x;x^=y;
}
void get_deep(int x){
vis[x]=true;
for(int i=last[x];i;i=e[i].next){
int id=e[i].to;
if(!vis[id]){
dep[id]=dep[x]+1;fa[id][0]=x;
get_deep(id);
}
}
}
void get_fa(){
fo(j,1,max_step){
fo(i,1,n){
fa[i][j]=fa[fa[i][j-1]][j-1];
}
}
}
int jump(int x,int y){
if(dep[x]<dep[y]) Swap(x,y);
int deep=dep[x]-dep[y];
fod(i,max_step,0){
if(((1<<i)&deep)) x=fa[x][i];
}
if(x==y) return x;
fod(i,max_step,0){
if(fa[x][i]!=fa[y][i]) {x=fa[x][i],y=fa[y][i];}
}
return fa[x][0];
}
int main(){
scanf("%d%d%d",&n,&m,&s);
int x,y;
fo(i,1,n-1){
scanf("%d%d",&x,&y);
add(x,y,1);
add(y,x,1);
}
max_step=log(n)/log(2)+1;
memset(vis,0,sizeof(vis));
dep[s]=1;
get_deep(s);
get_fa();
int a,b;
fo(i,1,m){
scanf("%d%d",&a,&b);
printf("%d\n",jump(a,b));
}
return 0;
}