import java.io.*; import java.util.*; class Main { static final long MOD=998244353; public static void main(String[] args) { MyScanner sc = new MyScanner(); out = new PrintWriter(new BufferedOutputStream(System.out)); int n=sc.nextInt(); int[]a=new int[n+1],b=new int[n+1],c=new int[n+1]; for(int i=2;i<=n;++i){ c[i]=sc.nextInt(); a[i]=sc.nextInt(); b[i]=sc.nextInt(); } int q=sc.nextInt(); while(q-->0){ long x=sc.nextInt(); long[]dp=new long[n+1]; dp[0]=1; dp[1]=x; for(int i=2;i<=n;++i){ if(c[i]==1) dp[i]=(dp[a[i]]+dp[b[i]])%MOD; else if(c[i]==2) dp[i]=a[i]*dp[b[i]]%MOD; else dp[i]=dp[a[i]]*dp[b[i]]%MOD; } out.println(dp[n]); } out.close(); } // http://codeforces.com/blog/entry/7018 //-----------PrintWriter for faster output--------------------------------- public static PrintWriter out; //-----------MyScanner class for faster input---------- public static class MyScanner { BufferedReader br; StringTokenizer st; public MyScanner() { br = new BufferedReader(new InputStreamReader(System.in)); } String next() { while (st == null || !st.hasMoreElements()) { try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); } } return st.nextToken(); } int nextInt() { return Integer.parseInt(next()); } long nextLong() { return Long.parseLong(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine(){ String str = ""; try { str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } return str; } } }