#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 998244353ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n;
int t[52], a[52], b[52];
ll fx[52];

int main(){
  scanf("%d",&n);
  FOR(i,2,n+1)scanf("%d%d%d",t+i,a+i,b+i);
  int q;
  scanf("%d",&q);
  while(q--){
    ll x;
    scanf("%lld", &x);
    fx[0] = 1;
    fx[1] = x;
    FOR(i,2,n+1){
      if(t[i]==1){
        fx[i] = (fx[a[i]] + fx[b[i]]) % MOD;
      }else if(t[i]==2){
        fx[i] = a[i] * fx[b[i]] % MOD;
      }else{
        fx[i] = fx[a[i]] * fx[b[i]] % MOD;
      }
    }
    printf("%lld\n",fx[n]);
  }
  return 0;
}