n = int(input())
queue = [1]
ins = {1: 0}
for i in range(2, n+1):
    k, p = map(int, input().split())
    if p == 0:
        ind = ins[k]
        queue.insert(ind, i)
        ins[i] = ind
        for j in range(ind+1, len(queue)):
            ins[queue[j]] += 1
    else:
        ind = ins[k] + 1
        queue.insert(ind, i)
        ins[i] = ind
        for j in range(ind+1, len(queue)):
            ins[queue[j]] += 1

m = int(input())
for i in range(m):
    x = int(input())
    if x in ins:
        ind = ins[x]
        queue.pop(ind)
        del ins[x]
        for j in range(ind, len(queue)):
            ins[queue[j]] -= 1

print(*queue)