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

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e5 + 10;

int n, m, q;
int len, a[MAXN];

vector <int> e[MAXN], g[MAXN];

int dfn[MAXN], low[MAXN], clk, bcc;
int st[MAXN], top;
inline void Tarjan(int u)
{
    dfn[u] = low[u] = ++clk, st[++top] = u;
    for (auto v : e[u])
        if (!dfn[v])
        {
            Tarjan(v), low[u] = min(low[u], low[v]);
            if (low[v] >= dfn[u])
            {
                bcc++;
                while (st[top] != v) g[st[top]].push_back(bcc), g[bcc].push_back(st[top]), top--;
                g[v].push_back(bcc), g[bcc].push_back(v), top--;
                g[u].push_back(bcc), g[bcc].push_back(u);
            }
        }
        else low[u] = min(low[u], dfn[v]);
}

int dis[MAXN], dep[MAXN], f[MAXN][21], lg[MAXN];
void DFS(int u, int fa)
{
    dfn[u] = ++clk, dep[u] = dep[fa] + 1, dis[u] = dis[fa] + (u <= n), f[u][0] = fa;
    for (int i = 1; i < lg[dep[u]]; i++)
        f[u][i] = f[f[u][i - 1]][i - 1];
    for (auto v : g[u])
        if (v != fa) DFS(v, u);
}
inline int LCA(int x, int y)
{
    if (dep[x] < dep[y]) swap(x, y);
    while (dep[x] > dep[y]) x = f[x][lg[dep[x] - dep[y]] - 1];
    if (x == y) return x;
    for (int i = lg[dep[x]] - 1; ~i; i--)
        if (f[x][i] != f[y][i]) x = f[x][i], y = f[y][i];
    return f[x][0];
}
inline int Dist(int u, int v) {return dis[u] - dis[v];}

inline void Solve()
{
    Read(n), Read(m);
    for (int i = 1; i <= n; i++)
    {
        e[i].clear();
        dfn[i] = low[i] = 0;
    }
    for (int i = 1; i <= bcc; i++)
    {
        g[i].clear();
        dis[i] = dep[i] = 0;
        for (int j = 0; j < 20; j++) f[i][j] = 0;
    }
    clk = top = 0, bcc = n;
    for (int i = 1, u, v; i <= m; i++) Read(u), Read(v), e[u].push_back(v), e[v].push_back(u);
    Tarjan(1);
    clk = 0, DFS(1, 0);
    Read(q);
    while (q--)
    {
        Read(len);
        for (int i = 1; i <= len; i++) Read(a[i]);
        sort(a + 1, a + len + 1, [&](int x, int y) {return dfn[x] < dfn[y];});
        st[top = 1] = a[1];
        int ans = 1 - len;
        for (int i = 2; i <= len; i++)
        {
            int lca = LCA(st[top], a[i]);
            while (top > 1 && dep[st[top - 1]] >= dep[lca]) ans += Dist(st[top], st[top - 1]), top--;
            if (st[top] == lca) st[++top] = a[i];
            else ans += Dist(st[top], lca), st[top] = lca, st[++top] = a[i];
        }
        while (top > 1) ans += Dist(st[top], st[top - 1]), top--;
        cout << ans << '\n';
    }
}

int main()
{
    // freopen("B.in", "r", stdin);
    // freopen("B.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    for (int i = 1; i < MAXN; i++) lg[i] = lg[i >> 1] + 1;
    int T;
    Read(T);
    while (T--) Solve();
    return 0;
}