#include<bits/stdc++.h>
using namespace std;
using ll = long long;

ll mod = 998244353;

int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  int n; cin >> n;
  vector<int> t(n + 2), a(n + 2), b(n + 2); 
  for(int i = 2; i <= n; i++) {
    cin >> t[i] >> a[i] >> b[i];
  } 
  int q; cin >> q;
  vector<ll> f(n + 1);
  for(int i = 0; i < q; i++) {
    int x; cin >> x;
    f[0] = 1; f[1] = x;
    for(int i = 2; i <= n; i++) {
      switch(t[i]) {
        case 1:
          f[i] = (f[a[i]] + f[b[i]]) % mod;
          break;
        case 2:
          f[i] = a[i] * f[b[i]] % mod;
          break;
        case 3:
          f[i] = f[a[i]] * f[b[i]] % mod;
          break;
      }
    }
    cout << f[n] << endl;
  }
}