#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

template<class TH>
void _dbg(const char* name, TH val){
    clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
    while(*names != ',') clog << *names++;
    clog << ": " << curr_val << ", ";
    _dbg(names+1, vals...);
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
    #define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg(...)
    #define dbg_arr(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

LL Inverse(LL n, LL m) {
    n %= m;
    if (n <= 1) return n; // Handles properly (n = 0, m = 1).
    return m - ((m * Inverse(m, n) - 1) / n);
}

// Fast exponentiation modulo mod. Returns x**e modulo mod.
// Assumptions: 0 <= x < m
//              mod < 2**31.
//              0 <= e < 2**63
LL pow(LL x, LL e, LL mod) {
    LL res = 1;
    for (; e >= 1; e >>= 1) {
        if (e & 1) res = res * x % mod;
        x = x * x % mod;
    }
    return res;
}

const int MAXN = 1<<17;
vector<int> aa[3][MAXN];
int nim[3][MAXN];

LL val[3][MAXN + 1];
const LL mod = 998244353;

LL res[MAXN+1];

void fwht(LL *data, int dim) {
    for (int len = 1; 2 * len <= dim; len <<= 1) {
        for (int i = 0; i < dim; i += 2 * len) {
            for (int j = 0; j < len; j++) {
                LL a = data[i + j];
                LL b = data[i + j + len];
                
                data[i + j] = (a + b) % mod;
                data[i + j + len] = (mod + a - b) % mod;
            }   
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!


    int N;
    cin >> N;
    dbg(N);
    for (int z = 0; z < 3; z++) {
        int M;
        cin >> M;
        for (int i = 0; i < M; i++) {
            int a, b;
            cin >> a >> b;
            if (a > b) swap(a, b);
            aa[z][a].push_back(b);
        }
        for (int i = N; i >= 1; i--) {
            vector<int> vals;
            for (int a: aa[z][i]) vals.push_back(nim[z][a]);
            sort(vals.begin(), vals.end());
            vals.erase(unique(vals.begin(), vals.end()), vals.end());
            nim[z][i] = 0;
            while (nim[z][i] < SZ(vals) and vals[nim[z][i]] == nim[z][i]) nim[z][i]++;
            val[z][nim[z][i]] = (val[z][nim[z][i]] + pow(10, 18*i, mod)) % mod;
        }
        fwht(val[z], MAXN);
    }

    for (int i = 0; i < MAXN; i++) {
        res[i] = val[0][i] * val[1][i] % mod;
        res[i] = res[i] * val[2][i] % mod;
    }

    fwht(res, MAXN);
    
    LL inv = Inverse(MAXN, mod);
    for (int i = 0; i < MAXN; i++) {
        res[i] = res[i] * inv % mod;
        if (res[i] < 0) res[i] += mod;
    }
    cout << res[0] << "\n";
    
}


Measured memory_bytes: 20480