#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

const int BBB = 1e9;
const int P = 998244353;
const int B = BBB * BBB % P;
const int MOD = P;
const int N = 1e6 + 6;
int ppow[N];
void SelfMod(int& a) {
  while (a >= MOD) {
    a -= MOD;
  }
}
void Dziel(int& a) {
  if (a % 2 == 0) {
    a /= 2;
  } else {
    a = (a + MOD) / 2;
  }
}
void transform(int x, int y, int* a)
{
  if ( x == y - 1) {
    return;
  }
  int l2 = ( y - x ) / 2;
  int z = x + l2;
  transform(x, z, a);
  transform(z, y, a);
  for (int i=x; i<z; i++) {
    int x1 = a[i];
    int x2 = a[i+l2];
    a[i] = (x1 - x2 + MOD);
    a[i+l2] = (x1 + x2);
    SelfMod(a[i]);
    SelfMod(a[i + l2]);
  }
}
// Reverses the transform in
// the interval [x, y) in a.
void untransform(int x, int y, int* a)
{
  if ( x == y - 1) {
    return;
  }
  int l2 = ( y - x ) / 2;
  int z = x + l2;
  for (int i=x; i<z; i++) {
    long long y1 = a[i];
    long long y2 = a[i+l2];
    // x1 - x2 = y1
    // x1 + x2 = y2
    // 2 * x1  = y1 + y2
    // 2 * x2  = y2 - y1
    
    // In order to solve those equations, we need to divide by 2
    // But we are performing operations modulo 1000000007
    // that needs us to find the modular multiplicative inverse of 2.
    // That is saved in the INV2 variable.
    
    a[i] = (y1 + y2);
    a[i+l2] = (y2 - y1 + MOD);
    SelfMod(a[i]);
    SelfMod(a[i + l2]);
    Dziel(a[i]);
    Dziel(a[i + l2]);
  }
  untransform(x, z, a);
  untransform(z, y, a);
}
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  ppow[0] = 1;
  RE (i, N - 2) {
    ppow[i] = ppow[i - 1] * B % P;
  }
  
  int n;
  cin>>n;
  int M = 1 << 17;
  VVI layers(4, VI(M));
  REP (tr, 3) {
    int m;
    cin>>m;
    VVI slo(n + 2);
    RE (i, m) {
      int a, b;
      cin>>a>>b;
      if (a > b) {
        swap(a, b);
      }
      slo[a].PB(b);
    }
    //VI vals(n + 2);
    VI which_layer(n + 2);
    FORD (i, n, 1) {
      set<int> zioms;
      for (auto nei : slo[i]) {
        zioms.insert(which_layer[nei]);
      }
      for (int mex = 0; ; mex++){
        if (zioms.count(mex) == 0) {
          layers[tr][mex] = (layers[tr][mex] + ppow[i]) % P;
          which_layer[i] = mex;
          break;
        }
      }
    }
    transform(0, M, &layers[tr][0]);
  }
  //int res = 0;
  REP (i, M) {
    int prod = 1;
    REP (tr, 3) {
      prod = prod * layers[tr][i] % P;
    }
    layers[3][i] = prod;
    //res = (res + prod) % P;
  }
  untransform(0, M, &layers[3][0]);
  cout<<layers[3][0]<<endl;
    

  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 17276