#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;

const int maxn=50010;

priority_queue<int,vector<int>,greater<int> >q[2];

int a[maxn],b[maxn],c[maxn];

void work(){
    while(!q[0].empty())q[0].pop();
    while(!q[1].empty())q[1].pop();
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1; i<=n; ++i)
        scanf("%d%d",&a[i],&b[i]);
    for(int i=0; i<m; ++i)
        scanf("%d",&c[i]);
    sort(c,c+m);
    int cnt=0,cur=0;
    for(int i=1; i<=n; ++i){
        while(!q[a[i]^1].empty()&&q[a[i]^1].top()<b[i]-cnt) q[a[i]^1].pop();
        q[a[i]].push(b[i]-cnt);
        while(cur<m&&c[cur]<=i) ++cnt,++cur;
    }
    printf("%d\n",q[0].size()+q[1].size());
}
        

int main(){
    int kase;
    scanf("%d",&kase);
    while(kase--) work();
    return 0;
}