import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 998_244_353;
alias Mint = ModInt!MO;

enum K = 3;
enum W = Mint(10L^^18);

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto M = new int[K];
      auto A = new int[][K];
      auto B = new int[][K];
      foreach (k; 0 .. K) {
        M[k] = readInt();
        A[k] = new int[M[k]];
        B[k] = new int[M[k]];
        foreach (i; 0 .. M[k]) {
          A[k][i] = readInt() - 1;
          B[k][i] = readInt() - 1;
        }
      }
      
      const l = bsr(N) + 1;
      auto xs = new Mint[1 << l];
      xs[] = Mint(1);
      foreach (k; 0 .. K) {
        auto graph = new int[][N];
        foreach (i; 0 .. M[k]) {
          graph[A[k][i]] ~= B[k][i];
          graph[B[k][i]] ~= A[k][i];
        }
        auto gs = new int[N];
        foreach_reverse (u; 0 .. N) {
          bool[int] app;
          foreach (v; graph[u]) {
            if (u < v) {
              app[gs[v]] = true;
            }
          }
          for (int g = 0; ; ++g) {
            if (g !in app) {
              gs[u] = g;
              break;
            }
          }
        }
        debug {
          if (N <= 10) {
            writeln("gs = ", gs);
          }
        }
        auto ys = new Mint[1 << l];
        Mint weight = 1;
        foreach (u; 0 .. N) {
          weight *= W;
          ys[gs[u]] += weight;
        }
        foreach (i; 0 .. l) {
          foreach (h; 0 .. 1 << l) {
            if (!(h & 1 << i)) {
              const tmp = ys[h] - ys[h | 1 << i];
              ys[h] += ys[h | 1 << i];
              ys[h | 1 << i] = tmp;
            }
          }
        }
        xs[] *= ys[];
      }
      foreach (i; 0 .. l) {
        foreach (h; 0 .. 1 << l) {
          if (!(h & 1 << i)) {
            const tmp = xs[h] - xs[h | 1 << i];
            xs[h] += xs[h | 1 << i];
            xs[h | 1 << i] = tmp;
          }
        }
      }
      const ans = xs[0] / (1 << l);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
