#include <bits/stdc++.h>
//#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;

//-----------------------------------------------------------------------------

int n,q;
const int mod=998244353;
int t[50],a[50],b[50];
ll f[50];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n;
	REP(i,n-1) {
		cin>>t[i]>>a[i]>>b[i];
	}
	cin>>q;
	REP(i,q) {
		int x;cin>>x;
		REP(j,n) f[j]=0;
		f[0]=1,f[1]=x;
		REP(j,n-1) {
			if(t[j]==1) f[j+2]=f[a[j]]+f[b[j]]%mod;
			else if(t[j]==2) f[j+2]=a[j]*f[b[j]]%mod;
			else f[j+2]=f[a[j]]*f[b[j]]%mod;
			//cout<<f[j+2]<<endl;
		}
		cout<<f[n]%mod<<endl;
	}

	return 0;
}