#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iomanip>

using namespace std;

#define REPU(i, a, b) for (int i = (a); i < (b); ++i)
#define REPD(i, a, b) for (int i = (a); i > (b); --i)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())

typedef long long ll;
const int MOD = 1000000007;

template<class T> inline T tmin(T a, T b) { return (a < b) ? a : b; }
template<class T> inline T tmax(T a, T b) { return (a > b) ? a : b; }
template<class T> inline void amax(T &a, T b) { if (b > a) a = b; }
template<class T> inline void amin(T &a, T b) { if (b < a) a = b; }
template<class T> inline T tabs(T a) { return (a > 0) ? a : -a; }
template<class T> T gcd(T a, T b) { while (b != 0) { T c = a; a = b; b = c % b; } return a; }

const int N = 50005;
int a[N], b[N], c[N], f[N], maxi[N][2];

int main(int argc, char *argv[]) {
    ios_base::sync_with_stdio(false);
    
    int ntest, n, m, c;
    
    cin >> ntest;
    while (ntest--) {
        cin >> n >> m;
        REPU(i, 0, n) cin >> a[i] >> b[i];
        fill(f, f + N, 0);
        REPU(i, 0, m) {
            cin >> c;
            f[0] += 1;
            if (c < N) f[c] -= 1;
        }
        b[0] += f[0];
        REPU(i, 1, N) {
            f[i] += f[i - 1];
            b[i] += f[i];
        }
        maxi[n][0] = maxi[n][1] = 0;
        REPD(i, n - 1, -1) {
            maxi[i][0] = maxi[i + 1][0];
            maxi[i][1] = maxi[i + 1][1];
            amax(maxi[i][a[i]], b[i]);
        }
        int ret = n;
        REPU(i, 0, n) {
            if (b[i] < maxi[i + 1][1 - a[i]]) ret--;
        }
        printf("%d\n", ret);
    }
    
    return 0;
}