#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=998244353;
int t[51], a[51], b[51], n;
ll solve(ll x){
	ll f[51]; f[0]=1, f[1]=x;
	for(int i=2; i<=n; i++){
		if(t[i]==1) f[i]=(f[a[i]]+f[b[i]])%MOD;
		else if(t[i]==2) f[i]=(ll)a[i]*f[b[i]]%MOD;
		else f[i]=f[a[i]]*f[b[i]]%MOD;
	}
	return f[n];
}
int main()
{
	cin>>n;
	for(int i=2; i<=n; i++) cin>>t[i]>>a[i]>>b[i];
	int q; cin>>q;
	for(int i=0; i<q; i++){
		ll x; cin>>x;
		cout<<solve(x)<<endl;
	}
	return 0;
}