#include <bits/stdc++.h>

using namespace std;

const long long MOD = 998244353;
const int MAX = 55;
long long f[MAX];
int t[MAX], a[MAX], b[MAX];

int main() {
    int n;
    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++) {
        long long x;
        cin >> x;
        memset(f, 0, sizeof(f));
        f[0] = 1;
        f[1] = x;
        for (int j = 2; j <= n; j++) {
            if (t[j] == 1) {
                f[j] = (f[a[j]] + f[b[j]]) % MOD;
            } else if (t[j] == 2) {
                f[j] = a[j] * f[b[j]] % MOD;
            } else {
                f[j] = (f[a[j]] * f[b[j]]) % MOD;
            }
        }
        cout << f[n] << endl;
    }
}