def is_tree(E):
    NN = len(E) + 1
    P = [-1 for i in range(NN)]
    def par(a):
        L = []
        while P[a] >= 0:
            L.append(a)
            a = P[a]
        for l in L:
            P[l] = a
        return a
    def unite(a, b):
        if par(a) != par(b):
            if P[par(b)] >= P[par(a)]:
                if P[par(b)] == P[par(a)]: P[par(a)] -= 1
                P[par(b)] = par(a)
            else:
                P[par(a)] = par(b)
    for a, b in E:
        if not 0 <= a < NN: return False
        if not 0 <= b < NN: return False
        if par(a) == par(b):
            return False
        unite(a, b)
    return True

N = int(input())
A = [int(a) for a in input().split()]
B = [int(a) for a in input().split()]
X = []
for i in range(N-1):
    x, y = map(int, input().split())
    X.append((x-1, y-1))

assert 1 <= N <= 10 ** 5
assert len(A) == N
assert len(B) == N
for a in A:
    assert - 10 ** 9 <= a <= 10 ** 9
for b in B:
    assert - 10 ** 9 <= b <= 10 ** 9

assert is_tree(X)