n = int(input())
mod = 998244353
ops = [None] * (n + 1)  # ops[2..n] will be used

for i in range(2, n + 1):
    t, a, b = map(int, input().split())
    ops[i] = (t, a, b)

q = int(input())
queries = list(map(int, input().split()))

for x in queries:
    val = [0] * (n + 1)
    val[0] = 1
    val[1] = x % mod
    for i in range(2, n + 1):
        t, a, b = ops[i]
        if t == 1:
            current = (val[a] + val[b]) % mod
        elif t == 2:
            current = (a * val[b]) % mod
        elif t == 3:
            current = (val[a] * val[b]) % mod
        val[i] = current
    print(val[n] % mod)