import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum long MO = 998244353; int N; int[] T, A, B; int Q; long[] X; void main() { try { for (; ; ) { N = readInt(); T = new int[N + 1]; A = new int[N + 1]; B = new int[N + 1]; foreach (i; 2 .. N + 1) { T[i] = readInt(); A[i] = readInt(); B[i] = readInt(); } Q = readInt(); X = new long[Q]; foreach (q; 0 .. Q) { X[q] = readLong(); } foreach (q; 0 .. Q) { auto f = new long[N + 1]; f[0] = 1; f[1] = X[q]; foreach (i; 2 .. N + 1) { switch (T[i]) { case 1: { f[i] = (f[A[i]] + f[B[i]]) % MO; } break; case 2: { f[i] = (A[i] * f[B[i]]) % MO; } break; case 3: { f[i] = (f[A[i]] * f[B[i]]) % MO; } break; default: assert(false); } } writeln(f[N]); } } } catch (EOFException e) { } }