#include <bits/stdc++.h>
using namespace std;

template <int MOD_> struct modnum {
	static constexpr int MOD = MOD_;
	static_assert(MOD_ > 0, "MOD must be positive");

private:
	using ll = long long;

	int v;

	static int minv(int a, int m) {
		a %= m;
		assert(a);
		return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);
	}

public:

	modnum() : v(0) {}
	modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }
	explicit operator int() const { return v; }
	friend std::ostream& operator << (std::ostream& out, const modnum& n) { return out << int(n); }
	friend std::istream& operator >> (std::istream& in, modnum& n) { ll v_; in >> v_; n = modnum(v_); return in; }

	friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }
	friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }

	modnum inv() const {
		modnum res;
		res.v = minv(v, MOD);
		return res;
	}
	friend modnum inv(const modnum& m) { return m.inv(); }
	modnum neg() const {
		modnum res;
		res.v = v ? MOD-v : 0;
		return res;
	}
	friend modnum neg(const modnum& m) { return m.neg(); }

	modnum operator- () const {
		return neg();
	}
	modnum operator+ () const {
		return modnum(*this);
	}

	modnum& operator ++ () {
		v ++;
		if (v == MOD) v = 0;
		return *this;
	}
	modnum& operator -- () {
		if (v == 0) v = MOD;
		v --;
		return *this;
	}
	modnum& operator += (const modnum& o) {
		v += o.v;
		if (v >= MOD) v -= MOD;
		return *this;
	}
	modnum& operator -= (const modnum& o) {
		v -= o.v;
		if (v < 0) v += MOD;
		return *this;
	}
	modnum& operator *= (const modnum& o) {
		v = int(ll(v) * ll(o.v) % MOD);
		return *this;
	}
	modnum& operator /= (const modnum& o) {
		return *this *= o.inv();
	}

	friend modnum operator ++ (modnum& a, int) { modnum r = a; ++a; return r; }
	friend modnum operator -- (modnum& a, int) { modnum r = a; --a; return r; }
	friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }
	friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }
	friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }
	friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }
};

template <typename T> T pow(T a, long long b) {
	assert(b >= 0);
	T r = 1; while (b) { if (b & 1) r *= a; b >>= 1; a *= a; } return r;
}

using num = modnum<998244353>;

int main(){
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

	num B = pow(num(10), 18);

	int n;
	cin >> n;

	vector<num> powB(n+1, 0);
	powB[0] = 1;
	for(int i = 1; i <= n; i++) powB[i] = B * powB[i-1];
	vector<num> dp = {1, 0};
	vector<map<int, num> > q;
	for(int _ = 0; _ < 3; _++){
		int m;
		cin >> m;
		vector<vector<int> > edges(n);
		for(int j = 0; j < m; j++){
			int a, b;
			cin >> a >> b;
			a--; b--;
			if(a < b) swap(a, b);
			edges[b].push_back(a);
		}
		vector<int> val(n, 0);
		map<int, num> freq;
		for(int v = n-1; v >= 0; v--){
			set<int> r;
			for(int w : edges[v]) r.insert(val[w]);
			while(r.count(val[v])) val[v]++;
			freq[val[v]] += powB[v+1];
		}
		q.push_back(freq);
	}
	num ans = 0;
	for(auto r : q[0]){
		for(auto s : q[1]){
			ans += q[2][r.first ^ s.first] * r.second * s.second;
		}
	}
	cout << ans << '\n';
}


Measured memory_bytes: 5200