#include <bits/stdc++.h>

#define R register
#define ll long long
#define sum(a, b, mod) (((a) + (b)) % mod)
#define Add(a, b, mod) ((a) = sum(a, b, mod))
#define meow(cat...) fprintf(stderr, cat)

const ll MaxN = 2e2 + 10;
const ll MaxM = MaxN * MaxN;
const ll mod = 998244353;

ll k, n[MaxN], m[MaxN], s[MaxN][MaxN][MaxN];
ll u[MaxN][MaxM], v[MaxN][MaxM], a[MaxN][MaxN];

inline ll read()
{
    ll x = 0;
    char ch = getchar();
    while(ch > '9' || ch < '0')
        ch = getchar();
    while(ch <= '9' && ch >= '0') 
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
    return x;
}

void init()
{
    for(int i = 1; i < k; i++)
        for(int j = 1; j <= m[i]; j++)
            u[i][j] = 0, v[i][j] = 0;
    for(int i = 0; i <= n[1]; i++)
        for(int j = 0; j <= n[1]; j++)
            a[i][j] = 0;
    for(int i = 0; i <= k; i++)
        for(int j = 1; j <= n[i]; j++)
            for(int l = 1; l <= n[i + 1]; l++)
                s[i][j][l] = 0;
    for(int i = 1; i <= k; i++)
        n[i] = m[i] = 0;
}

ll solve(ll n)
{
    ll res = 1;
    for (ll i = 1; i <= n; i++)
    {
        for (ll j = i + 1; j <= n; j++)
        {
            while (a[i][i])
            {
                ll rest = a[j][i] / a[i][i];
                for (ll k = i; k <= n; k++)
                    Add(a[j][k], mod - (ll)a[i][k] * rest % mod, mod);
                std::swap(a[i], a[j]), res = -res;
            }
            std::swap(a[i], a[j]), res = -res;
        }
    }
    for (ll i = 1; i <= n; i++)
        res = (ll)res * a[i][i] % mod;
    return sum(res, mod, mod);
}

signed main()
{   
    int T = read();
    while(T--)
    {
        init(), k = read();
        for(ll i = 1; i <= k; i++) n[i] = read();
        for(ll i = 1; i < k; i++) m[i] = read();
        for(ll i = 1; i < k; i++)
            for(ll j = 1; j <= m[i]; j++)
                u[i][j] = read(), v[i][j] = read();
        for(ll i = 1; i <= n[k]; i++) s[k][i][i] = 1;
        for(ll i = k - 1; i; i--)
        {
            for(int j = 1; j <= m[i]; j++)
                for(int o = 1; o <= n[k]; o++)
                    Add(s[i][u[i][j]][o], s[i + 1][v[i][j]][o], mod);
        }
        for(ll i = 1; i <= n[1]; i++)
            for(ll j = 1; j <= n[1]; j++)
                a[i][j] = s[1][i][j];
        printf("%lld\n", solve(n[1]));
    }
    return 0;
}