#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
/*#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
#pragma GCC target("avx2")  //Enable AVX*/

using namespace std;

using ll = long long;

#define mp make_pair

const int p = 998244353;

int mul(int a, int b) {
    return (1LL * a * b) % p;
}

int add(int a, int b) {
    int s = (a+b);
    if (s>=p) s-=p;
    return s;
}

int sub(int a, int b) {
    int s = (a+p-b);
    if (s>=p) s-=p;
    return s;
}

int po(int a, int deg)
{
    if (deg==0) return 1;
    if (deg%2==1) return mul(a, po(a, deg-1));
    int t = po(a, deg/2);
    return mul(t, t);
}

int inv(int n)
{
    return po(n, p-2);
}

/*struct DSU {
    vector<int> sz;
    vector<int> parent;

    void make_set(int v) {
        parent[v] = v;
        sz[v] = 1;
    }

    int find_set(int v) {
        if (v == parent[v])
            return v;
        return parent[v] = find_set(parent[v]);
    }

    void union_sets(int a, int b) {
        a = find_set(a);
        b = find_set(b);
        if (a != b) {
            if (sz[a] < sz[b])
                swap(a, b);
            parent[b] = a;
            sz[a] += sz[b];
        }
    }

    DSU(int n) {
        sz.resize(n);
        parent.resize(n);
        for (int i = 0; i < n; i++) make_set(i);
    }
};*/

/*const int N = 1000000;

vector<int> facs(N), invfacs(N);

void init()
{
    facs[0] = 1;
    for (int i = 1; i<N; i++) facs[i] = mul(facs[i-1], i);
    invfacs[N-1] = inv(facs[N-1]);
    for (int i = N-2; i>=0; i--) invfacs[i] = mul(invfacs[i+1], i+1);
}

int C(int n, int k)
{
    return mul(facs[n], mul(invfacs[k], invfacs[n-k]));
}*/

int n;

const int N = 1<<17;

const int K = po(10, 18);


vector<int> process()
{
    vector<vector<int>> G(n+1);
    int m;
    cin>>m;
    int a, b;
    for (int i = 0; i<m; i++){
        cin>>a>>b;
        if (a>b) swap(a, b);
        G[a].push_back(b);
    }

    vector<int> ans(n+1);
    for (int i = n; i>=1; i--)
    {
        set<int> nims;
        for (auto it: G[i]) nims.insert(ans[it]);
        while (nims.find(ans[i])!=nims.end()) ans[i]++;
    }

    vector<int> gopa(N);

    for (int i = 1; i<=n; i++) gopa[ans[i]] = add(gopa[ans[i]], po(K, i));
    return gopa;
}

vector<int> FWHT(vector<int> P, bool inverse) {
    for (int len = 1; 2 * len <= P.size(); len <<= 1) {
        for (int i = 0; i < P.size(); i += 2 * len) {
            for (int j = 0; j < len; j++) {
                int u = P[i + j];
                int v = P[i + len + j];
                P[i + j] = add(u, v);
                P[i + len + j] = sub(u, v);
            }
        }
    }

    if (inverse) {
        for (int i = 0; i < P.size(); i++)
            P[i] = mul(P[i], inv(P.size()));
    }
    return P;
}

vector<int> mult(vector<int> P, vector<int> Q)
{
    P = FWHT(P, false);
    Q = FWHT(Q, false);
    for (int i = 0; i<N; i++) P[i] = mul(P[i], Q[i]);
    P = FWHT(P, true);
    return P;
}



int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);

    cin>>n;
    vector<vector<int>> answer(3);
    for (int i = 0; i<3; i++) answer[i] = process();

    vector<int> res1 = mult(answer[0], answer[1]);
    res1 = mult(res1, answer[2]);
    cout<<res1[0];



}




Measured memory_bytes: 6352