#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cmath>
#include <ctime>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <utility>
#include <algorithm>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int,int> PII;

const LD eps=1e-9;
const LD PI=atan2((LD)0,(LD)-1);
const LL MOD=1000000007;
const int INF=1<<30;
const int ARR_INF=1<<6;
const int MAXN=50005;

struct GT
{
    int team;
    int b;
}gt[MAXN];

int n,m;
map<int,int> mp;
int add[MAXN];

int Solve(int team)
{
    int now;
    int killed=0;
    for(now=n;now>0;now--)
    {
        if(gt[now].team==team)
            break;
    }
    for(int i=now;i>0;i--)
    {
        if(gt[i].team==gt[now].team)
        {
            if(gt[i].b+add[i]>gt[now].b+add[now])
                now=i;
        }
        else
        {
            if(gt[i].b+add[i]<gt[now].b+add[now])
                killed++;
        }
    }
    return killed;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        mp.clear();
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
            scanf("%d%d",&gt[i].team,&gt[i].b);
        for(int i=1;i<=m;i++)
        {
            int fg;
            scanf("%d",&fg);
            mp[fg]++;
        }
        memset(add,0,sizeof(add));
        for(int i=n;i>0;i--)
            add[i]=add[i+1]+mp[i];
        int ans=n-Solve(0);
        ans-=Solve(1);
        printf("%d\n",ans);
    }
    return 0;
}