// Author: wlzhouzhuan
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fir first
#define sec second
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, l, r) for (int i = l; i >= r; i--)
#define mset(s, t) memset(s, t, sizeof(s))
#define mcpy(s, t) memcpy(s, t, sizeof(t))
#define poly vector<int>
#define SZ(x) (int(x.size()))
template<typename T1, typename T2> void ckmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> void ckmax(T1 &a, T2 b) { if (a < b) a = b; }

namespace IO {
  const int SIZE = 1 << 23;
  char ibuf[SIZE], *iS, *iT;
  char obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1;
  bool flush() {
    fwrite(obuf, 1, oS - obuf, stdout);
    oS = obuf;
    return true;
  }
  #define gc() (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
  #define pc(x) (*oS++ = x) 
  int read() {
    int x = 0, f = 0;
    char c = gc();
    while (!isdigit(c)) f |= c == '-', c = gc();
    while (isdigit(c)) x = 10 * x + c - '0', c = gc();
    return f ? -x : x;
  }
  char qu[55]; int qlen;
  template <class T> void print(T x) {
    if (!x) pc('0');
    if (x < 0) pc('-'), x = -x;
    while (x) qu[++qlen] = x % 10 + '0', x /= 10;
    while (qlen) pc(qu[qlen--]);
  }
  template <class T> void print(T x, char charset) {
    print(x), pc(charset);
  }
  struct Flusher {
    ~Flusher() {
      flush();
    }
  } flusher;
}
using namespace IO;

const int mod = 998244353;
const ull modd = 1ull * mod * mod;

inline int qpow(int a, int b = mod - 2) {
  int res = 1;
  while (b > 0) {
    if (b & 1) res = 1ll * res * a % mod;
    a = 1ll * a * a % mod;
    b >>= 1;
  }
  return res;
}

int mat[201][201], f[201][201];
int matn, matm;
int k, n[101], m[101];

void mul(int n, int m, int t) { 
  static ull tmp[201][201];
  for (int i = 1; i <= n; i++)
    memset(tmp[i], 0, sizeof(ull) * (t + 1));
  for (register int j = 1; j <= m; j++) {
    for (register int k = 1; k <= t; k++) {
      if (!f[j][k]) continue;
      for (register int i = 1; i <= n; i++) {
        tmp[i][k] += mat[i][j];
      }
    }
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= t; j++)
      mat[i][j] = tmp[i][j] % mod;
  matn = n, matm = t;
}

int det(int n) {
  int res = 1;
  for (int i = 1; i <= n; i++) {
    int who = -1;
    for (int j = i; j <= n; j++)
      if (mat[j][i]) {
        who = j;
        break;
      } 
    if (!~who) return 0;
    if (who != i) {
      for (int j = 1; j <= n; j++)
        swap(mat[i][j], mat[who][j]);
      res = (mod - res) % mod;
    }
    for (int j = i + 1; j <= n; j++) {
      int div = 1ll * mat[j][i] * qpow(mat[i][i]) % mod;
      for (int k = i; k <= n; k++)
        mat[j][k] = (mat[j][k] + mod - 1ll * mat[i][k] * div % mod) % mod;
    }
    res = 1ll * res * mat[i][i] % mod;
  }
  return res;
}
void solve() {
  k = read();
  for (int i = 1; i <= k; i++) n[i] = read();
  for (int i = 1; i < k; i++) m[i] = read();
  for (int t = 1; t < k; t++) {
    for (int i = 1; i <= n[t]; i++)
      for (int j = 1; j <= n[t + 1]; j++)
        f[i][j] = 0;
    while (m[t]--) {
      int u = read(), v = read();
      f[u][v] = 1;
    }
    if (t == 1) {
      matn = n[1], matm = n[2];
      for (int i = 1; i <= matn; i++)
        memcpy(mat[i], f[i], 4 * (matm + 1));
    }
    else mul(matn, matm, n[t + 1]);
  }
//  assert(matn == matm);
//  for (int i = 1; i <= matn; i++) {
//    for (int j = 1; j <= matm; j++)
//      printf("%d ", mat[i][j]);
//    puts("");
//  }
  print(det(matn), '\n');
}

int main() {
  int T = read();
  while (T--) solve();
  return 0;
}

/*
1
3
2 3 2
4 4
1 1
1 2
2 1
2 3
1 2
2 1
3 1
3 2
*/