本题是处理边权:val[u]++,val[v]++,val[lca(u,v)]-=2
如果处理点权的话,则是:val[u]++,val[v]++,val[lca(u,v)]--,val[fa[lca(u,v)]]--
#include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
const int N=2e4+100;
int t,n,m,u,v,x,minn,val[N],sum[N],f[N][16],h[N];
vector<int> e[N];
void dfs(int cur,int fa){
sum[cur]=val[cur];
for(int i=0;i<(int)e[cur].size();++i){
if(e[cur][i]==fa)continue;
dfs(e[cur][i],cur);
sum[cur]+=sum[e[cur][i]];
}
}
void ff(int cur,int fa){
f[cur][0]=fa;
for(int i=1;i<=15;++i)
f[cur][i]=f[f[cur][i-1]][i-1];
for(int i=0;i<(int)e[cur].size();++i){
if(e[cur][i]==fa)continue;
h[e[cur][i]]=h[cur]+1;
ff(e[cur][i],cur);
}
}
int lca(int a,int b){
int x;
if(h[b]>h[a])a^=b^=a^=b;
if(h[a]>h[b]){
x=h[a]-h[b];
for(int i=0;i<=15;++i)
if((1<<i)&x)
a=f[a][i];
}
if(a==b)return a;
for(int i=15;i>=0;--i){
if(f[a][i]!=f[b][i]){
a=f[a][i];
b=f[b][i];
}
}
return f[a][0];
}
int main(){
scanf("%d",&t);
for(int ca=1;ca<=t;++ca){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i){
e[i].clear();
val[i]=0;
for(int j=0;j<=15;++j)
f[i][j]=0;
}
for(int i=1;i<n;++i){
scanf("%d%d",&u,&v);
e[u].push_back(v);
e[v].push_back(u);
}
h[1]=0;
ff(1,0);
m-=n-1;
while(m--){
scanf("%d%d",&u,&v);
val[u]++;
val[v]++;
x=lca(u,v);
val[x]-=2;
}
dfs(1,0);
minn=sum[2];
for(int i=3;i<=n;++i)
minn=min(minn,sum[i]);
printf("Case #%d: %d\n",ca,minn+1);
}
return 0;
}