import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]


def main():
    md=998244353
    n=II()
    tab=[(-1,-1,-1),(-1,-1,-1)]+LLI(n-1)
    q=II()
    xx=MI()

    for x in xx:

        memo={}
        def f(i):
            if i == 0: return 1
            if i == 1: return x
            if i in memo:return memo[i]
            t, a, b = tab[i]
            if t == 1: res=(f(a) + f(b))
            if t == 2: res=a * f(b)
            if t == 3: res=f(a) * f(b)
            res%=md
            memo[i]=res
            return res

        print(f(n))

main()