/* cerberus97 - Hanit Banga */

#include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

#define pb push_back
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL)

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 1e5 + 10, mod = 998244353;
const ll base = ll(1e18) % mod;

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

int mul(ll a, int b) {
	a *= b;
	return a % mod;
}

int pbase[N];

vector<pii> get(int n);

int main() {
	fast_cin();
	int n; cin >> n;
	pbase[0] = 1;
	for (int i = 1; i <= n; ++i) {
		pbase[i] = mul(pbase[i - 1], base);
	}
	vector<vector<pii>> g(3);
	for (auto& v : g) {
		v = get(n);
	}
	vector<int> sum(2 * n + 1, 0);
	for (auto& p1 : g[0]) {
		for (auto& p2 : g[1]) {
			sum[p1.first ^ p2.first] = add(sum[p1.first ^ p2.first], mul(p1.second, p2.second));
		}
	}
	int ans = 0;
	for (auto& p : g[2]) {
		ans = add(ans, mul(p.second, sum[p.first]));
	}
	cout << ans << endl;
}

vector<pii> get(int n) {
	vector<vector<int>> g(n + 1);
	int m; cin >> m;
	while (m--) {
		int u, v;
		cin >> u >> v;
		g[min(u, v)].pb(max(u, v));
	}
	vector<int> v(n + 1, 0);
	map<int, int> temp;
	for (int i = n; i >= 1; --i) {
		set<int> seen;
		for (auto& j : g[i]) {
			seen.insert(v[j]);
		}
		while (seen.count(v[i])) {
			++v[i];
		}
		temp[v[i]] = add(temp[v[i]], pbase[i]);
	}
	vector<pii> ans(temp.begin(), temp.end());
	return ans;
}