#include "iostream"
#include "cstring"
#include "cstdio"
#include "algorithm"
#include "queue"
#include "vector"
#include "queue"
#include "stack"
#include "ctime"
#include "set"
#include "map"
#include "cmath"
using namespace std;
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define mp make_pair
#define rep( i , a , b ) for( int i = (a) , i##end = b ; i <= i##end ; ++ i )
#define per( i , a , b ) for( int i = (a) , i##end = b ; i >= i##end ; -- i )
#define mem( a ) memset( a , 0 , sizeof (a) )
#define all( x ) x.begin() , x.end()
//#define int long long
typedef long long ll;
const int MAXN = 2e5 + 10;
int n , q;

vi G[MAXN];

int dep[MAXN] , dfn[MAXN] , clo , R[MAXN];
int g[MAXN][20];
void dfs( int u ) {
	dfn[u] = ++ clo;
	for( int v : G[u] ) {
		dep[v] = dep[u] + 1;
		g[v][0] = u;
		rep( k , 1 , 17 ) g[v][k] = g[g[v][k - 1]][k - 1];
		dfs( v );
	}
	R[u] = clo;
}
int lca( int u , int v ) {
	if( dep[u] < dep[v] ) swap( u , v );
	per( k , 17 , 0 ) if( dep[g[u][k]] >= dep[v] ) u = g[u][k];
	if( u == v ) return u;
	per( k , 17 , 0 ) if( g[u][k] != g[v][k] ) u = g[u][k] , v = g[v][k];
	return g[u][0];
}

vi V[MAXN];

int A[MAXN] , B[MAXN] , C[MAXN];

int oc , sa[MAXN] , sb[MAXN] , res;
void afs( int u , int f ) {
	if( C[u] ) ++ oc;
	sa[u] = A[u] , sb[u] = B[u];
	for( int v : G[u] ) afs( v , u ) , sa[u] += sa[v] , sb[u] += sb[v];
	if( sa[u] && sb[u] && oc ) ++ res;
	if( C[u] ) -- oc;
	if( oc && sa[u] && sb[u] ) res += dep[u] - dep[f] - 1;
}

void solve() {
	cin >> n >> q;
	rep( i , 2 , n ) {
		int f;
		scanf("%d",&f);
		G[f].pb( i );
	}
	dep[1] = 1 , dfs( 1 );
	rep( i , 1 , q ) {
		int a , b , c , u;
		scanf("%d%d%d",&a,&b,&c);
		vi vec;
		rep( k , 1 , a ) scanf("%d",&u) , A[u] = 1 , vec.pb( u );
		rep( k , 1 , b ) scanf("%d",&u) , B[u] = 1 , vec.pb( u );
		rep( k , 1 , c ) scanf("%d",&u) , C[u] = 1 , vec.pb( u );
		vec.pb( 1 );
		sort( all( vec ) , [&]( int u , int v ) { return dfn[u] < dfn[v]; } );
		rep( t , 1 , vec.size() - 1 ) vec.pb( lca( vec[t] , vec[t - 1] ) );
		sort( all( vec ) , [&]( int u , int v ) { return dfn[u] < dfn[v]; } );
		vi stk;
		rep( t , 0 , vec.size() - 1 ) {
			while( stk.size() && R[stk.back()] < dfn[vec[t]] ) stk.pop_back();
			if( stk.size() ) V[stk.back()].pb( vec[t] );
			stk.pb( vec[t] );
		}
		oc = res = 0;
		afs( 1 , 1 );
		printf("%d\n",res);
		for( int x : vec ) A[x] = B[x] = C[x] = sa[x] = sb[x] = 0 , V[x].clear();
	}
	clo = 0;
	rep( i , 1 , n ) mem( g[i] ) , G[i].clear();
}

signed main() {
//	freopen("in","r",stdin);
//	freopen("out","w",stdout);
	int T;cin >> T;while( T-- ) solve();
//	solve();
}