import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

N=int(readline())
mod=998244353
TAB=[tuple(map(int,readline().split())) for i in range(N-1)]
Q=int(readline())
for x in map(int,readline().split()):
    F=[1,x]
    for t,a,b in TAB:
        if t==1:
            F.append(F[a]+F[b])
        elif t==2:
            F.append(a*F[b])
        else:
            F.append(F[a]*F[b])
        F[-1]%=mod
    ans=F[N]
    print(ans)