void main(){
  import std.stdio, std.string, std.conv, std.algorithm;

  int n; rd(n);
  auto t=new int[](n+1), a=new int[](n+1), b=new int[](n+1);
  for(int i=2; i<=n; i++) rd(t[i], a[i], b[i]);
  int q; rd(q);
  auto xs=readln.split.to!(long[]);
  const long mod=998244353;
  foreach(x; xs){
    auto f=new long[](n+1);
    f[0]=1; f[1]=x;
    for(int i=2; i<=n; i++){
      if(t[i]==1){
        f[i]=(f[a[i]]+f[b[i]])%mod;
      }else if(t[i]==2){
        f[i]=(a[i]*f[b[i]])%mod;
      }else{
        f[i]=(f[a[i]]*f[b[i]])%mod;
      }
    }
    writeln(f[n]);
  }
}

void rd(T...)(ref T x){
  import std.stdio, std.string, std.conv;
  auto l=readln.split;
  assert(l.length==x.length);
  foreach(i, ref e; x){
    e=l[i].to!(typeof(e));
  }
}
void wr(T...)(T x){
  import std.stdio;
  foreach(e; x) write(e, " ");
  writeln();
}