#include <iostream>
#include <vector>
using namespace std;
const long long MOD = 998244353;
int main(){
	int n;
	cin >> n;
	vector<int> t(n + 1), a(n + 1), b(n + 1);
	for (int i = 2; i <= n; i++){
		cin >> t[i] >> a[i] >> b[i];
	}
	int q;
	cin >> q;
	vector<int> x(q);
	for (int i = 0; i < q; i++){
		cin >> x[i];
	}
	vector<vector<long long>> f(n + 1, vector<long long>(q));
	for (int i = 0; i < q; i++){
		f[0][i] = 1;
		f[1][i] = x[i];
	}
	for (int i = 2; i <= n; i++){
		for (int j = 0; j < q; j++){
			if (t[i] == 1){
				f[i][j] = (f[a[i]][j] + f[b[i]][j]) % MOD;
			}
			if (t[i] == 2){
				f[i][j] = a[i] * f[b[i]][j] % MOD;
			}
			if (t[i] == 3){
				f[i][j] = f[a[i]][j] * f[b[i]][j] % MOD;
			}
		}
	}
	for (int i = 0; i < q; i++){
		cout << f[n][i] << endl;
	}
}