大佬网址:树剖LCA讲解 - 一蓑烟雨任生平 - 博客园 (cnblogs.com)
题目网址:P3379 【模板】最近公共祖先(LCA) - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
const int inf=0x3f3f3f3f;
const int maxn=1e6+10;
const int Mod=998244353;
ll T=1,n,m,s;
ll dad[maxn],to[maxn<<1],head[maxn],top[maxn],deep[maxn],cnt,nxt[maxn],size[maxn],x,y;
void add(ll u,ll v){
nxt[++cnt]=head[u];
head[u]=cnt;
to[cnt]=v;
}
void dfs_deep(ll x,ll fa){
//cout<<fa<<"\n";
size[x]=1;
if(fa==-1) deep[x]=0;
else deep[x]=deep[fa]+1;
for(ll i=head[x];to[i];i=nxt[i]){
if(to[i]==fa) continue;
dad[to[i]]=x;
dfs_deep(to[i],x);
size[x]+=size[to[i]];
}
}
void dfs(ll x){
ll t=0;
if(!top[x]) top[x]=x;
for(ll i=head[x];to[i];i=nxt[i]){
if(to[i]!=dad[x]&&size[to[i]]>size[t]){
t=to[i];
}
}
if(t){
top[t]=top[x];
dfs(t);
}
for(ll i=head[x];to[i];i=nxt[i]){
if(to[i]==dad[x]) continue;
if(t!=to[i]) dfs(to[i]);
}
}
ll lca(ll x,ll y){
for(;top[x]!=top[y];){
if(deep[top[x]]<deep[top[y]]){
int tmp=x;x=y;y=tmp;
}
x=dad[top[x]];
}
if(deep[x]>deep[y]){
int tmp=x;x=y;y=tmp;
}
return x;
}
void solve()
{
cin>>n>>m>>s;
for(ll i=1;i<n;i++){
cin>>x>>y;
add(x,y);
add(y,x);
}
dfs_deep(s,-1);
dfs(s);
for(ll i=0;i<m;i++){
cin>>x>>y;
cout<<lca(x,y)<<"\n";
}
}
int main()
{IOS
//freopen("in.in","r",stdin),freopen("out.out","w",stdout);
// cin>>T;
while(T--)
solve();
return 0;
}