#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;


int n, m, q;

namespace batyr {

    const int N = 1e6 + 10;

    const int LOG = 12;
    int tin[N], tout[N], up[N][11];
    int timer = 0;
    int depth[N];
    ll solo_ans[N];
    int sz[N];

    bool upper(int v, int u) {
        return tin[v] <= tin[u] && tin[u] <= tout[v];
    }

    int lca(int v, int u) {
        if (upper(v, u))
            return v;
        if (upper(u, v))
            return u;
        for (int i = LOG - 1; i >= 0; i--) {
            for (int z = 0; z < 3; z++) {
                if (!upper(up[v][i], u))
                    v = up[v][i];
            }
        }
        return up[v][0];
    }

    int dist(int v, int u) {
        return depth[v] + depth[u] - 2 * depth[lca(v, u)];
    }

    bool in_path(int v, int u, int w) {
        return dist(v, w) + dist(u, w) == dist(v, u);
    }

    int lift(int v, int u) {
        for (int i = LOG - 1; i >= 0; i--) {
            for (int z = 0; z < 3; z++) {
                if (!upper(up[v][i], u))
                    v = up[v][i];
            }
        }
        return v;
    }


    vector<int> G[N];


    void dfs2(int v, int pr) {
        if (v == pr)
            depth[v] = 0;
        else
            depth[v] = depth[pr] + 1;
        tin[v] = ++timer;
        up[v][0] = pr;
        for (int i = 1; i < LOG; i++)
            up[v][i] = up[up[up[up[v][i - 1]][i - 1]][i - 1]][i - 1];
        sz[v] = (v <= n);
        solo_ans[v] = 1ll * n * (n + 1) / 2;
        for (auto to: G[v]) {
            if (to == pr)
                continue;
            dfs2(to, v);
            sz[v] += sz[to];
            solo_ans[v] -= 1ll * sz[to] * (sz[to] + 1) / 2;
        }
        solo_ans[v] -= 1ll * (n - sz[v]) * (n - sz[v] + 1) / 2;
        tout[v] = timer;
    }

}


const int maxN = 1e6 + 100;
vector<int> g[maxN / 2];
int maxColor = 0;
int tin[maxN / 2], up[maxN / 2];
int timer;
bool used[maxN / 2];
vector<pair<int, int> > byClr[maxN / 2];

void paint(int v, int color, int par) {
    used[v] = true;
    for (int u: g[v]) {
        if (u == par) continue;
        pair<int, int> it = minmax(u, v);
        if (!used[u]) {
            if (up[u] >= tin[v]) {
                int color = ++maxColor;
                byClr[color].emplace_back(it);
                paint(u, color, v);
            } else {
                byClr[color].emplace_back(it);
                paint(u, color, v);
            }
        } else if (tin[u] < tin[v]) {
            byClr[color].emplace_back(it);
        }
    }
}

void dfs(int v, int par) {
    timer++;
    up[v] = tin[v] = timer;
    used[v] = true;
    for (int u: g[v]) {
        if (u == par) continue;
        if (used[u]) {
            up[v] = min(up[v], tin[u]);
        } else {
            dfs(u, v);
            up[v] = min(up[v], up[u]);
        }
    }
}

vector<int> in_block[maxN / 2];
int k;
int a[maxN];

void solve_byp() {
    for (int i = 1; i <= n; i++) {
        if (!used[i]) dfs(i, -1);
    }
    for (int i = 1; i <= n; i++) used[i] = false;
    for (int i = 1; i <= n; i++) {
        if (!used[i]) {
            paint(i, maxColor, -1);
        }
    }
    for (int i = 1; i <= maxColor; i++) {
        if (!byClr[i].empty()) {
            for (auto it: byClr[i]) {
                in_block[i].emplace_back(it.first);
                in_block[i].emplace_back(it.second);
            }
            sort(in_block[i].begin(), in_block[i].end());
            in_block[i].erase(unique(in_block[i].begin(), in_block[i].end()), in_block[i].end());
            for (int p: in_block[i]) {
                batyr::G[i + n].push_back(p);
                batyr::G[p].push_back(i + n);
            }
        }
    }
}

void solve() {
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    solve_byp();
    batyr::dfs2(1, 1);

    while (q--) {
        cin >> k;
        for (int i = 0; i < k; i++)
            cin >> a[i];
        sort(a, a + k);
        k = unique(a, a + k) - a;
        if (k == 1) {
            cout << batyr::solo_ans[a[0]] << "\n";
            continue;
        }
        bool OK = 1;
        int V, U;
        V = U = a[0];
        for (int i = 1; i < k && OK; i++) {
            if (batyr::in_path(V, U, a[i]))
                continue;
            if (batyr::in_path(V, a[i], U))
                U = a[i];
            else if (batyr::in_path(U, a[i], V))
                V = a[i];
            else
                OK = 0;
        }
        if (!OK) {
            cout << 0 << "\n";
            continue;
        }
        int szV, szU;
        if (!batyr::upper(V, U))
            szV = batyr::sz[V];
        else
            szV = n - batyr::sz[batyr::lift(U, V)];
        if (!batyr::upper(U, V))
            szU = batyr::sz[U];
        else
            szU = n - batyr::sz[batyr::lift(V, U)];
        cout << 1ll * szV * szU << "\n";
    }


    timer = 0;
    for (int i = 1; i <= n; i++) {
        used[i] = false;
    }
    for (int i = 1; i <= n; i++) {
        g[i].clear();
    }
    for (int i = 1; i <= maxColor; i++) {
        byClr[i].clear();
        in_block[i].clear();
    }

    for (int i = 1; i <= n + maxColor; i++) {
        batyr::G[i].clear();
    }

    maxColor = 0;


    batyr::timer = 0;
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }
    return 0;
}