#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

template <class T1, class T2>
ostream& operator << (ostream& out, const pair <T1, T2> p)
{
    out << '(' << p.first << ',' << p.second << ')';
    return out;
}

template <class T1, class T2>
istream& operator >> (istream& in, pair<T1, T2> &p)
{
    in >> p.first >> p.second;
    return in;
}

template <class T>
istream& operator >> (istream& in, vector<T> &v)
{
    for (T &x : v)
        in >> x;
    return in;
}

template <class T>
ostream& operator << (ostream& out, const vector<vector<T>> &v)
{
    for (const vector<T> &x : v)
        out << x << '\n';
    return out;
}

template <class T>
ostream& operator << (ostream& out, const vector<T> &v)
{
    for (const T &x : v)
        out << x << ' ';
    return out;
}

long long gcd (long long a, long long b)
{
    if (b > a)
        swap(a, b);
    return (b ? gcd(b, a % b) : a);
}

using ll   = long long;
using pii  = pair<int, int>;
using pll  = pair<long long, long long>;
using tiii = pair<pair<int, int>, int>;
using vi   = vector<int>;
using vl   = vector<long long>;
using vvi  = vector<vector<int>>;
using vvl  = vector<vector<long long>>;

#define F          first
#define S          second
#define First      first.first
#define Second     first.second
#define Third      second
#define mp         make_pair
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define per(i,b,a) for (int i = (b); i > (a); i--)
#define all(x)     x.begin(), x.end()
#define ret(x)     return cout << x, 0;
#define throwex    throw runtime_error ("Found the error.");

const int h = 998244353;

signed main()
{
    ios::sync_with_stdio(false);
    #ifdef ONLINE_JUDGE
    cin.tie(nullptr);
    cout.tie(nullptr);
    cerr.setstate(ios::failbit);
    #endif

    int n;
    cin >> n;
    vi m(3);
    vector<vvi> M(3, vvi(n));
    vvi grundy(3, vi(n));
    rep(i,0,3)
    {
        cin >> m[i];
        rep(j,0,m[i])
        {
            int x, y;
            cin >> x >> y;
            x--, y--;
            if(y < x)
                swap(x, y);
            M[i][x].push_back(y);
        }
    }
    rep(i,0,3)
    {
        per(j,n-1,-1)
        {
            set<int> s;
            for(int x : M[i][j])
                s.insert(grundy[i][x]);
            while(s.count(grundy[i][j]))
                grundy[i][j]++;
        }
    }
    // cerr << grundy << '\n';
    int base = ll(1e18) % h;
    ll ans = 0;
    vector<map<int, int>> v(3);
    rep(i,0,3)
    {
        ll contribution = base;
        rep(j,0,n)
        {
            (v[i][grundy[i][j]] += contribution) %= h;
            (contribution *= base) %= h;
        }
    }
    for(auto x : v[0])
        for(auto y : v[1])
        {
            ll z = x.S;
            (((z *= y.S) %= h) *= v[2][x.F ^ y.F]) %= h;
            (ans += z) %= h;
        }
    cout << ans;
}


Measured memory_bytes: 16588