#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 998244353;
const double pi = acos(-1);
const double eps = 1e-10;
const int N = 55;
ll n, t[N], a[N], b[N], f[N], z[N], q, x;
ll ff(ll m){
  if(f[m] >= 0) return f[m];
  switch(t[m]){
    case 1:
      f[m] = (ff(a[m]) + ff(b[m])) % mod;
      break;
    case 2:
      f[m] = a[m] * ff(b[m]) % mod;
      break;
    case 3:
      f[m] = ff(a[m]) * ff(b[m]) % mod;
      break;
    default:
      break;
  }
  return f[m];
}

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> n;
  FOR(i, 2, n+1) cin >> t[i] >> a[i] >> b[i];
  cin >> q;
  FOR(i, 0, 55) z[i] = -1;
  f[0] = 1;
  FOR(i, 0, q){
    cin >> x;
    memmove(f, z, sizeof(z));
    f[0] = 1;
    f[1] = x;
    cout << ff(n) << endl;
  }
  return 0;
}