#include<bits/stdc++.h>
#define reg register  
const int N=1e5+10;
int n,a[N],ans;
std::vector<int> G[N];
struct BIT{
	int c[N];
	inline void mdf(reg int x,reg int k){for (;x<=n;x+=x&-x) c[x]+=k;}
	inline int qry(reg int x){reg int res=0;for (;x;x-=x&-x) res+=c[x];return res;}
	inline void mdf(reg int l,reg int r,reg int k){mdf(l,k),mdf(r+1,-k);}
}T;
int dfn[N],dfc,sz[N],son[N],fa[N],dep[N],top[N];
void dfs1(reg int u,reg int fat=0){
	dep[u]=dep[fa[u]=fat]+(sz[u]=1);
	for (auto v:G[u]) if (v^fat) dfs1(v,u),sz[u]+=sz[v],sz[son[u]]<sz[v]?son[u]=v:0;
}
void dfs2(reg int u,reg int fst){
	top[u]=fst,dfn[u]=++dfc; if (!son[u]) return; dfs2(son[u],fst);
	for (auto v:G[u]) if (v!=fa[u]&&v!=son[u]) dfs2(v,v);
}
void initialize(int N, std::vector<int> A, std::vector<int> B){
	n=N; for (reg int i=1;i<=n;i++) a[i]=-1;
	for (reg int i=0;i<n-1;i++) A[i]++,B[i]++,G[A[i]].push_back(B[i]),G[B[i]].push_back(A[i]);
	dfs1(1),dfs2(1,1);
	return;
}
void dfs(reg int u){
	sz[u]=a[u]==1;
	for (auto v:G[u]) if (v^fa[u]) dfs(v),sz[u]+=sz[v];
	// std::cerr<<"<< "<<u<<" "<<sz[u]<<"\n";
	if (a[fa[u]]==0) ans+=sz[u]/2,sz[u]=0;
}
int generate(int v, bool result){
	v++,a[v]=result,ans=0;
	dfs(1);
	// std::cerr<<"--------\n";
	return ans;
}