#include<bits/stdc++.h>

using namespace std;

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

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

const int MAXN = 100000;
const ll MOD = 998244353;
const ll PO = 1000000000000000000LL%MOD;
const int SQ = 450;

int n;
vector<int> lis[3][100100];
ll an1[100100];
ll anv[SQ+10];
int an2[100100];
ll anv2[SQ+10];
int an3[100100];
int ma[SQ+10][SQ+10];
ll po[300100];

int chk[100100];
int chk2[100100][SQ+10];
int main(){
	scanf("%d",&n);
	int m;
	for (int t=0;t<3;t++) {
		scanf("%d", &m);
		for (int i = 0; i < m; i++) {
			int a, b;
			scanf("%d%d", &a, &b); a--; b--;
			if (a>b) swap(a,b);
			lis[t][a].push_back(b);
		}
	}
	po[0] = 1;
	for (int i=1;i<=3*n;i++) po[i] = po[i-1]*PO%MOD;
	for (int i=n-1;i>=0;i--) {
		for (int &j : lis[0][i]) chk[an1[j]] = 1;
		int t;
		for (t=0;chk[t];t++);
		an1[i] = t;
		anv[t] = (anv[t]+po[i])%MOD;
		for (int &j : lis[0][i]) chk[an1[j]] = 0;
	}
	for (int i = n - 1; i >= 0; i--) {
		for (int &k : lis[1][i]) chk2[i][an2[k]]=1;
		int t;
		for (t = 0; chk2[i][t]; t++);
		an2[i] = t;
		//anv2[0] = (anv2[0] + anv[t]*po[i]) % MOD;
		for (int &k : lis[1][i]) chk2[i][an2[k]]=0;
	}
	for (int j=0;j<SQ;j++) {
		for (int i=0;i<SQ;i++) {
			for (int k=0;k<i;k++) chk[ma[j][k]]=1;
			for (int k=0;k<j;k++) chk[ma[k][i]]=1;
			int t;
			for (t=0;t<SQ&&chk[t];t++);
			ma[j][i] = t;
			for (int k=0;k<i;k++) chk[ma[j][k]]=0;
			for (int k=0;k<j;k++) chk[ma[k][i]]=0;
		}
		for (int i=0;i<n;i++) {
			anv2[j] = (anv2[j]+anv[ma[j][an2[i]]]*po[i])%MOD;
		}
	}
	ll ans = 0;
	for (int i=n-1;i>=0;i--) {
		for (int &j : lis[2][i]) chk[an3[j]] = 1;
		int t;
		for (t=0;chk[t];t++);
		an3[i] = t;
		ans = (ans+anv2[t]*po[i])%MOD;
		for (int &j : lis[2][i]) chk[an3[j]] = 0;
	}
	printf("%lld\n",ans*po[3]%MOD);

	return 0;
}
