#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ for(auto it : P) { s << "<" << it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ for(auto it : P) { s << "<" << it.first << "->" << it.second << "> "; } return s << endl; }


template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

const int MOD = 998244353;
using mint = Fp<MOD>;

using Graph = vector<vector<int>>;
int N;
vector<int> M;
vector<Graph> G;
vector<mint> ten;

void pre() {
    int MAX = 510000;
    ten.assign(MAX, 1);
    mint fac = modpow(mint(10), 18);
    for (int i = 1; i <= MAX; ++i) ten[i] = ten[i-1] * fac;
}

mint solve() {
    vector<vector<int>> grundy(3, vector<int>(N, -1));
    vector<vector<mint>> memo(3, vector<mint>(1000, 0));
    for (int iter = 0; iter < 3; ++iter) {
        for (int v = N-1; v >= 0; --v) {
            set<int> gse;
            for (auto e : G[iter][v]) gse.insert(grundy[iter][e]);
            int gres = 0;
            while (gse.count(gres)) ++gres;
            grundy[iter][v] = gres;
            memo[iter][gres] += ten[v+1];
        }
    }
    mint res = 0;
    for (int a = 0; a < 1000; ++a) {
        if (memo[0][a] == 0) break;
        for (int b = 0; b < 1000; ++b) {
            if (memo[1][b] == 0) break;
            int c = a^b;
            res += memo[0][a] * memo[1][b] * memo[2][c];
        }
    }
    return res;
}

int main() {
    pre();
    cin >> N;
    M.assign(3, 0);
    G.assign(3, Graph(N, vector<int>()));
    for (int iter = 0; iter < 3; ++iter) {
        cin >> M[iter];
        for (int i = 0; i < M[iter]; ++i) {
            int a, b; cin >> a >> b; --a, --b;
            G[iter][a].push_back(b);
            G[iter][b].push_back(a);
        }
    }
    cout << solve() << endl;
}


Measured memory_bytes: 21208