n = int(input())

# Read and discard the red edges
for _ in range(n-1):
    input()

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

extra = 0
for v in range(1, n + 1):
    extra += max(0, degree[v] - 2)

print((n-1) + extra)