#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long int ll;
const ll MOD = 998244353;
struct func { int t, a, b; };
func F[51];
bool vis[51];
ll val[51];
int n,q;

ll fnct(ll ind, ll par) {
	if (vis[ind])return val[ind];
	ll ans;
	if (ind == 0)ans = 1;
	else if (ind == 1)ans = par;
	else {
		if (F[ind].t == 1)ans = (fnct(F[ind].a, par) + fnct(F[ind].b, par)) % MOD;
		else if (F[ind].t == 2)ans = (F[ind].a*fnct(F[ind].b, par)) % MOD;
		else ans = (fnct(F[ind].a, par) * fnct(F[ind].b, par)) % MOD;
	}
	vis[ind] = true; val[ind] = ans;
	return ans;
}

int main() {
	cin >> n;
	for (int i = 2; i <= n; i++) {
		cin >> F[i].t >> F[i].a >> F[i].b;
		F[i].a %= MOD; F[i].b %= MOD;
	}
	cin >> q;
	for (int i = 0; i < q; i++) {
		int x; cin >> x;
		memset(vis, false, sizeof(vis));
		cout << fnct(n, x) << endl;
	}
	return 0;
}