//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <cstdint>

namespace n91 {

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  using value_type = u64;

  static constexpr u64 mod = Modulus;

private:
  static_assert(mod < static_cast<u64>(1) << 32,
                "Modulus must be less than 2**32");

  u64 v;

  constexpr modint &negate() noexcept {
    if (v != 0)
      v = mod - v;
    return *this;
  }

public:
  constexpr modint(const u64 x = 0) noexcept : v(x % mod) {}
  constexpr u64 &value() noexcept { return v; }
  constexpr const u64 &value() const noexcept { return v; }
  constexpr modint operator+() const noexcept { return modint(*this); }
  constexpr modint operator-() const noexcept { return modint(*this).negate(); }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    v += rhs.v;
    if (v >= mod)
      v -= mod;
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (v < rhs.v)
      v += mod;
    v -= rhs.v;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    v = v * rhs.v % mod;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = mod - 2;
    while (exp) {
      if (exp % 2 != 0)
        *this *= rhs;
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
  constexpr bool operator==(const modint rhs) const noexcept {
    return v == rhs.v;
  }
  constexpr bool operator!=(const modint rhs) const noexcept {
    return v != rhs.v;
  }
};
template <std::uint_fast64_t Modulus>
constexpr typename modint<Modulus>::u64 modint<Modulus>::mod;

} // namespace n91

#include <vector>

namespace n91 {

template <class T> void f(std::vector<T> &a) {
  const usize n = a.size();
  for (usize d = 1; d < n; d *= 2) {
    for (usize m = d * 2, i = 0; i < n; i += m) {
      for (usize j = 0; j < d; j += 1) {
        T x = a[i + j], y = a[i + j + d];
        a[i + j] = x + y;
        a[i + j + d] = x - y;
      }
    }
  }
}

template <class T> void inv_f(std::vector<T> &a) {
  const T i2 = T(1) / T(2);
  const usize n = a.size();
  for (usize d = 1; d < n; d *= 2) {
    for (usize m = d * 2, i = 0; i < n; i += m) {
      for (usize j = 0; j < d; j += 1) {
        T x = a[i + j], y = a[i + j + d];
        a[i + j] = (x + y) * i2;
        a[i + j + d] = (x - y) * i2;
      }
    }
  }
}

} // namespace n91

#include <set>

namespace n91 {

using mint = modint<998244353>;

constexpr usize Size = 1 << 17;

std::vector<mint> calc(const std::vector<std::vector<usize>> &g) {
  mint uc = 1;
  for (const usize i : rep(0, 18)) {
    uc *= 10;
  }
  const usize n = g.size();
  std::vector<mint> pows(n + 1);
  pows[0] = 1;
  for (const usize i : rep(0, n)) {
    pows[i + 1] = pows[i] * uc;
  }
  std::vector<mint> ans(Size, 0);
  std::vector<usize> grundy(n, n + 1);
  for (const usize i : revrep(0, n)) {
    std::set<usize> st;
    for (const usize e : g[i]) {
      st.insert(grundy[e]);
    }
    usize k = 0;
    while (st.count(k)) {
      k += 1;
    }
    grundy[i] = k;
    ans[k] += pows[i + 1];
  }
  return ans;
}

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  std::vector<mint> ans(Size, 0);
  ans[0] = 1;
  for (const usize loop : rep(0, 3)) {
    const usize m = scan<usize>();
    auto g = md_vec(n, 0, usize());
    for (const usize i : rep(0, m)) {
      usize a = scan<usize>() - 1;
      usize b = scan<usize>() - 1;
      if (a > b)
        std::swap(a, b);
      g[a].push_back(b);
    }
    auto v = calc(g);
    f(ans);
    f(v);
    for (const usize i : rep(0, Size)) {
      ans[i] *= v[i];
    }
    inv_f(ans);
  }
  std::cout << ans[0].value() << std::endl;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 8192