#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

struct pattern_pair{
    int t, a, b;
};

vector<pattern_pair> patterns;

long dp[51];

long f(int subscript, long number){
    if(dp[subscript] != -1){
        return dp[subscript];
    }else if(!subscript){
        return dp[subscript] = 1;
    }else if(subscript == 1){
        return dp[subscript] = number;
    }else if(patterns[subscript - 2].t == 1){
        return dp[subscript] = (f(patterns[subscript - 2].a, number) + f(patterns[subscript - 2].b, number)) % 998244353;
    }else if(patterns[subscript - 2].t == 2){
        return dp[subscript] = long(patterns[subscript - 2].a * f(patterns[subscript - 2].b, number)) % 998244353;
    }else{
        return dp[subscript] = f(patterns[subscript - 2].a, number) * f(patterns[subscript - 2].b, number) % 998244353;
    }
}

int main(){
    int n;
    cin >> n;
    patterns.resize(n - 1);
    for(int i = 0; i < n - 1; i++){
        cin >> patterns[i].t >> patterns[i].a >> patterns[i].b;
    }
    int q;
    cin >> q;
    for(int i = 0; i < q; i++){
        long x;
        cin >> x;
        fill(dp, dp + 51, -1);
        cout << f(n, x) << endl;
    }
}