#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
struct seg {
vector<int> val[2][2];
void build(int n) {
for (int i=0;i<=4*n;i++) {
val[0][0].push_back(0);
val[0][1].push_back(0);
val[1][0].push_back(0);
val[1][1].push_back(0);
}
}
void merg(int c) {
val[0][0][c]=min(min(val[0][0][(c<<1)]+val[0][0][(c<<1)+1],val[0][1][(c<<1)]+val[1][0][(c<<1)+1]),
min(val[0][1][(c<<1)]+val[0][0][(c<<1)+1],val[0][0][(c<<1)]+val[1][0][(c<<1)+1])+1);
val[0][1][c]=min(min(val[0][0][(c<<1)]+val[0][1][(c<<1)+1],val[0][1][(c<<1)]+val[1][1][(c<<1)+1]),
min(val[0][1][(c<<1)]+val[0][1][(c<<1)+1],val[0][0][(c<<1)]+val[1][1][(c<<1)+1])+1);
val[1][0][c]=min(min(val[1][0][(c<<1)]+val[0][0][(c<<1)+1],val[1][1][(c<<1)]+val[1][0][(c<<1)+1]),
min(val[1][1][(c<<1)]+val[0][0][(c<<1)+1],val[1][0][(c<<1)]+val[1][0][(c<<1)+1])+1);
val[1][1][c]=min(min(val[1][0][(c<<1)]+val[0][1][(c<<1)+1],val[1][1][(c<<1)]+val[1][1][(c<<1)+1]),
min(val[1][1][(c<<1)]+val[0][1][(c<<1)+1],val[1][0][(c<<1)]+val[1][1][(c<<1)+1])+1);
}
void init(int c, int l, int r) {
if (l==r) {
val[0][0][c]=0;
val[1][1][c]=0;
val[0][1][c]=1e6;
val[1][0][c]=1e6;
} else {
int mid=(l+r)/2;
init((c<<1),l,mid);
init((c<<1)+1,mid+1,r);
merg(c);
}
}
void upd(int c, int l, int r, int t, int ca, int cb) {
// cout<<"stupd "<<c<<' '<<l<<' '<<r<<' '<<t<<' '<<ca<<' '<<cb<<endl;
if (l>t || r<t) return;
if (l==r) {
val[0][0][c]=ca;
val[1][1][c]=cb;
} else {
int mid=(l+r)/2;
upd((c<<1),l,mid,t,ca,cb);
upd((c<<1)+1,mid+1,r,t,ca,cb);
merg(c);
}
}
};
struct ln {
int par=0;
int sz=0;
seg st;
};
ln hld[100001];
vector<int> gt[100001],vec;
int n,m,i,j,k,t,t1,u,v,a,b;
int ln_cnt;
int stat[100001];
int ca[100001],cb[100001];
pii(int) id[100001];
int subt[100001];
void get_subt(int x, int p){
subt[x]=1;
for (auto g : gt[x]) if (g-p) {
get_subt(g,x);
subt[x]+=subt[g];
}
}
void dfs(int x, int p, int col) {
hld[col].sz++;
id[x]={col,hld[col].sz};
int a=0,b=0;
for (auto g : gt[x]) if (g-p) {
if (subt[g]>a) {
a=subt[g];
b=g;
}
}
for (auto g : gt[x]) if (g-p) {
if (g==b) {
dfs(g,x,col);
} else {
ln_cnt++;
hld[ln_cnt].par=x;
dfs(g,x,ln_cnt);
}
}
}
void initialize(int N, vector<int> A, vector<int> B) {
n=N;
for (i=1;i<n;i++) {
gt[A[i-1]].push_back(B[i-1]);
gt[B[i-1]].push_back(A[i-1]);
}
get_subt(1,-1);
ln_cnt=1;
dfs(1,-1,1);
for (i=1;i<=ln_cnt;i++) {
hld[i].st.build(hld[i].sz);
hld[i].st.init(1,1,hld[i].sz);
}
}
void update_recurse(int v) {
// cout<<"upd "<<v<<endl;
int idx=id[v].fi, idy=id[v].se;
int pr=hld[idx].par;
int ma,mb;
if (pr) {
ma=min(hld[idx].st.val[0][0][1],hld[idx].st.val[0][1][1]);
mb=min(hld[idx].st.val[1][0][1],hld[idx].st.val[1][1][1]);
ca[pr]-=min(ma,mb+1);
cb[pr]-=min(mb,ma+1);
}
if (stat[v]==0) {
hld[idx].st.upd(1,1,hld[idx].sz,idy,ca[v],cb[v]);
}
if (stat[v]==1) {
hld[idx].st.upd(1,1,hld[idx].sz,idy,ca[v],1e6);
}
if (stat[v]==2) {
hld[idx].st.upd(1,1,hld[idx].sz,idy,1e6,cb[v]);
}
if (pr) {
ma=min(hld[idx].st.val[0][0][1],hld[idx].st.val[0][1][1]);
mb=min(hld[idx].st.val[1][0][1],hld[idx].st.val[1][1][1]);
ca[pr]+=min(ma,mb+1);
cb[pr]+=min(mb,ma+1);
update_recurse(pr);
}
}
int unify(int v) {
update_recurse(v);
int res=1e6;
res=min(res,hld[1].st.val[0][0][1]);
res=min(res,hld[1].st.val[0][1][1]);
res=min(res,hld[1].st.val[1][0][1]);
res=min(res,hld[1].st.val[1][1][1]);
// for (i=1;i<=n;i++) {
// cout<<ca[i]<<' '<<cb[i]<<endl;
// }
return res;
}
int cat(int v) {
stat[v]=1;
return unify(v);
}
int dog(int v) {
stat[v]=2;
return unify(v);
}
int neighbor(int v) {
stat[v]=0;
return unify(v);
}
// N;
