#include <stdio.h>

const long long mod = 998244353;
int N,T[55],A[55],B[55];
int Q; long long F[55][55];

int main()
{
	scanf ("%d",&N);
	for (int i=2;i<=N;i++) scanf ("%d %d %d",&T[i],&A[i],&B[i]);

	scanf ("%d",&Q);
	for (int i=0;i<Q;i++){
		F[0][i] = 1;
		scanf ("%lld",&F[1][i]);
	}

	for (int i=2;i<=N;i++){
		if (T[i] == 1) for(int j=0;j<Q;j++) F[i][j] = (F[A[i]][j] + F[B[i]][j]) % mod;
		if (T[i] == 2) for(int j=0;j<Q;j++) F[i][j] = (A[i] * F[B[i]][j]) % mod;
		if (T[i] == 3) for(int j=0;j<Q;j++) F[i][j] = (F[A[i]][j] * F[B[i]][j]) % mod;
	}

	for (int i=0;i<Q;i++) printf ("%lld\n",F[N][i]);

	return 0;
}