// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "catdog.h"
vector<ll> adj[N];
vector<ll> a(N); // 0 = none, 1 = cat, 2 = dog
void initialize(int n, std::vector<int> A, std::vector<int> B) {
rep(i,n){
ll u = A[i], v = B[i];
adj[u].pb(v), adj[v].pb(u);
}
}
ll dp[N][3];
void dfs(int u, int p){
rep(j,3) dp[u][j] = 0;
if(a[u] == 0){
}
else if(a[u] == 1){
dp[u][0] = dp[u][2] = inf2;
}
else{
dp[u][0] = dp[u][1] = inf2;
}
trav(v,adj[u]){
if(v == p) conts;
dfs(v, u);
if(a[u] == 0){
dp[u][0] += min({dp[v][0], dp[v][1] + 1, dp[v][2] + 1});
}
if(a[u] != 2){
dp[u][1] += min({dp[v][0], dp[v][1], dp[v][2] + 1});
}
if(a[u] != 1){
dp[u][2] += min({dp[v][0], dp[v][1] + 1, dp[v][2]});
}
}
}
ll get_ans(){
dfs(1, -1);
ll mn = inf2;
rep(j,3) amin(mn, dp[1][j]);
return mn;
}
int cat(int v) {
a[v] = 1;
return get_ans();
}
int dog(int v) {
a[v] = 2;
return get_ans();
}
int neighbor(int v) {
a[v] = 0;
return get_ans();
}
