#include<bits/stdc++.h>
#define ll long long
#define eb emplace_back
#define ep emplace
#define pii pair<int,int>
#define fi first
#define se second
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define mems(arr,x) memset(arr,x,sizeof(arr))
#define memc(arr1,arr2) memcpy(arr1,arr2,sizeof(arr2))
using namespace std;
const int maxn=2e5+10;
int n,m,k;
int a[maxn];
bool in[maxn],bk[maxn];
namespace Graph{
    const int maxm=maxn<<1;
    #define go(x,i) for(int i=head[x];i;i=e[i].nxt)
    int cnt=1;
    int head[maxn];
    struct edge{int nxt,to;}e[maxm];
    inline void add(int u,int v){e[++cnt]={head[u],v};head[u]=cnt;}
    inline void adde(int u,int v){add(u,v);add(v,u);}
    inline void rebuild(){cnt=1;for(int i=1;i<=k;i++)head[i]=0;}
}
using namespace Graph;
int w[maxn];
set<pii> q;
void bfs(){
    for(int u=1;u<=n;u++){
        if(!in[u])  continue;
        go(u,i){
            int t=e[i].to;
            if(in[t])   continue;
            bk[t]=true;
            w[t]++;
        }
    }
    q.clear();
    for(int i=1;i<=k;i++)
        if(w[i]&&bk[i])    q.ep(w[i],i);
    int tt=0;
    while(!q.empty()){
        int u=(--q.end())->se;
        // printf("%d %d\n",(--q.end())->fi,(--q.end())->se);
        q.erase(--q.end());
        in[u]=true;
        // printf("u = %d\n",u);
        tt++;if(tt==2)    return;
        go(u,i){
            int t=e[i].to;
            if(in[t])   continue;
            q.erase(pii(w[t],t));
            w[t]++;
            q.ep(pii(w[t],t));
        }
    }
}
pii E[maxn];
void solve(){
    rebuild();
    for(int i=1;i<=k;i++)   in[i]=w[i]=bk[i]=0;
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++){scanf("%d",&a[i]);in[a[i]]=true;}
    for(int i=1;i<=m;i++){
        int u,v;scanf("%d%d",&u,&v);
        if(u==v)    w[u]++;
        E[i]=pii(u,v);
        adde(u,v);
    }
    bfs();
    int ans=0;
    for(int i=1;i<=m;i++)
        ans+=(in[E[i].fi]&&in[E[i].se]);
    printf("%d\n",ans);
}
int main(){
    int T;scanf("%d",&T);while(T--)solve();
}