#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>

template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

template <class Cost = int>
struct Edge {
    int src, dst;
    Cost cost;
    Edge(int src = -1, int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = int>
using Graph = std::vector<std::vector<Edge<Cost>>>;

constexpr int MOD = 998244353;
using mint = ModInt<MOD>;

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

void brute() {
    int n;
    std::cin >> n;

    std::vector<mint> tens(n + 1);
    {
        mint ten = 1;
        for (int i = 0; i < 18; ++i) ten *= 10;

        tens[0] = 1;
        for (int i = 1; i <= n; ++i) {
            tens[i] = tens[i - 1] * ten;
        }
    }

    std::vector<Graph<>> graphs(3);
    std::vector<mint> iss, dss;
    for (auto& graph : graphs) {
        graph.resize(n);

        int m;
        std::cin >> m;

        while (m--) {
            int u, v;
            std::cin >> u >> v;
            --u, --v;
            graph[u].emplace_back(u, v);
            graph[v].emplace_back(v, u);
        }
    }

    mint ans = 0;
    auto used = vec(n, vec(n, vec(n, false)));
    for (int s = (n - 1) * 3; s >= 0; --s) {
        for (int i = 0; i < n && i <= s; ++i) {
            for (int j = 0; j < n && i + j <= s; ++j) {
                int k = s - i - j;
                if (k >= n || used[i][j][k]) continue;

                std::cerr << i + 1 << " " << j + 1 << " " << k + 1 << std::endl;
                ans += tens[i + 1] * tens[j + 1] * tens[k + 1];

                for (auto e : graphs[0][i]) {
                    used[e.dst][j][k] = true;
                }
                for (auto e : graphs[1][j]) {
                    used[i][e.dst][k] = true;
                }
                for (auto e : graphs[2][k]) {
                    used[i][j][e.dst] = true;
                }
            }
        }
    }
    std::cout << ans << std::endl;
}

void solve() {
    int n;
    std::cin >> n;

    std::vector<mint> tens(n + 1);
    {
        mint ten = 1;
        for (int i = 0; i < 18; ++i) ten *= 10;

        tens[0] = 1;
        for (int i = 1; i <= n; ++i) {
            tens[i] = tens[i - 1] * ten;
        }
    }

    std::vector<Graph<>> graphs(3);
    std::vector<std::vector<mint>> iss;
    for (auto& graph : graphs) {
        graph.resize(n);

        int m;
        std::cin >> m;

        while (m--) {
            int u, v;
            std::cin >> u >> v;
            --u, --v;
            graph[u].emplace_back(u, v);
            graph[v].emplace_back(v, u);
        }

        std::vector<bool> used(n, false);
        iss.push_back(std::vector<mint>());

        while (std::any_of(used.begin(), used.end(), [](auto b) { return !b; })) {
            std::vector<bool> out = used;
            mint score = 0;
            for (int v = n - 1; v >= 0; --v) {
                if (out[v]) continue;

                used[v] = true;
                score += tens[v + 1];
                for (auto e : graph[v]) {
                    out[e.dst] = true;
                }
            }

            iss.back().push_back(score);
        }
    }

    mint ans = 0;

    for (int i = 0; i < (int)iss[0].size(); ++i) {
        for (int j = 0; j < (int)iss[1].size(); ++j) {
            for (int k = 0; k < (int)iss[2].size(); ++k) {
                if ((i ^ j ^ k) == 0) {
                    ans += iss[0][i] * iss[1][j] * iss[2][k];
                }
            }
        }
    }

    std::cout << ans << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);

    // brute();
    solve();

    return 0;
}


Measured memory_bytes: 19712