import sys sys.setreccursionlimit(10**6) MOD = 998244353 Inv2 = pow(2,MOD-2,MOD) N = int(input()) G = {i:[] for i in range(1,N+1)} for _ in range(N-1): u,v = map(int,input().split()) G[u].append(v) G[v].append(u) A = [0]+list(map(int,input().split())) T = [[0,0] for i in range(N+1)] Pa = [0]*(N+1) def dfs(i): global cnt for j in G[i]: if j==Pa[i]:continue T[j][0]=cnt cnt += 1 Pa[j] = i dfs(j) T[j][1] = cnt cnt += 1 cnt = 0 T[1][0] = cnt cnt += 1 dfs(1) T[1][1] = cnt ans = 0 for i in range(1,N+1): B = [] C = [] for j in G[i]: if A[j]>A[i]: B.append(j) elif A[j]