#include <iostream>

#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;

#define  MAXN 105

#define  INF  0x7fffffff

int dp[MAXN*2][MAXN];

bool grah[MAXN][MAXN];

int a[MAXN*2];

int main()

{

    int T;

    scanf("%d",&T);

    while(T--)

    {

        int n1,n2,n;

        scanf("%d%d",&n1,&n2);

        memset(grah,false,sizeof(grah));

        while(n2--)

        {

            int x,y;

            scanf("%d%d",&x,&y);

            grah[x][y]=grah[y][x]=true;

        }

        scanf("%d",&n);

        for(int i=1;i<=n;i++)

            scanf("%d",&a[i]);

        for(int i=1;i<=n1;i++)

            dp[0][i]=0;

        dp[0][a[1]]=0;

        for(int i=1;i<=n;i++)

        for(int j=1;j<=n1;j++)

        {

            dp[i][j]=INF;

            for(int k=1;k<=n1;k++)

            if(j==k||grah[j][k])

            {

                 if(j==a[i]) dp[i][j]=min(dp[i][j],dp[i-1][k]) ;

                 else

                 dp[i][j]=min(dp[i][j],dp[i-1][k]+1) ;

            }

        }

        int ans=INF;

        for(int i=1;i<=n1;i++)

            ans=min(ans,dp[n][i]);

        printf("%d\n",ans);

    }

    return 0;

}