n = int(input())
# Read red edges (not used)
for _ in range(n-1):
    input()

degree = [0] * (n + 1)  # 1-based indexing

# Read black edges and compute degrees
for _ in range(n-1):
    c, d = map(int, input().split())
    degree[c] += 1
    degree[d] += 1

count = 0
for i in range(1, n+1):
    if degree[i] % 2 == 1:
        count += 1

k = count // 2
if count == 0:
    k = 1

ans = (n-1) + (k - 1)
print(ans)