#include<bits/stdc++.h>
using namespace std;
const int N = 1005, M = 10005;
int n, m, head[N], vi[M], wi[M], ne[M], tot, a[N], p[N];
int s, t, dis[N], cur[N];
bool b[N];
void addedge(int u, int v, int w){
	ne[++tot] = head[u], vi[tot] = v, wi[tot] = w, head[u] = tot;
}
void add(int u, int v, int w){
	addedge(u, v, w);
	addedge(v, u, w);
}
queue <int> q;
bool bfs(){
	memset(dis, -1, sizeof(dis));
	dis[s] = 0;
	while(!q.empty())
		q.pop();
	q.push(s);
	while(!q.empty()){
		int x = q.front();
		q.pop();
		for(int i = head[x]; i; i = ne[i]){
			int y = vi[i];
			if(dis[y] == -1 && wi[i]){
				dis[y] = dis[x] + 1;
				if(y == t)
					return 1;
				q.push(y);
			}
		}
	}
	return 0;
}
int dfs(int x, int lim){
	if(x == t)
		return lim;
	int flow = 0;
	for(int &i = cur[x]; i; i = ne[i]){
		int y = vi[i];
		if(dis[y] != dis[x] + 1 || !wi[i])
			continue;
		int dlt = dfs(y, min(lim - flow, wi[i]));
		wi[i] -= dlt, flow += dlt, wi[i ^ 1] += dlt;
		if(flow == lim)
			break;
	}
	return flow;
}
int dinic(){
	int flow, sum = 0;
	while(bfs()){
		memcpy(cur, head, sizeof(int) * (n + 1));
		while((flow = dfs(s, 1e9)))
			sum += flow;
	}
	return sum;
}
int main(){
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int Cases;
	cin >> Cases;
	while(Cases--){
		cin >> n >> m;
		tot = 1, s = 0, t = n + 1;
		memset(head, 0, sizeof(int) * (t + 1));
		memset(b, 0, sizeof(bool) * (n + 1));
		for(int i = 1, x; i <= m; i++){
			cin >> x;
			b[x] = 1;
		}
		int cnt = 2 * m;
		for(int i = 1; i <= n; i++){
			cin >> a[i];
			p[i] = i;
			if(b[i] && b[i - 1]){
				cnt -= 2;
				add(s, i, 1);
				add(s, i - 1, 1);
				add(i, i - 1, 1);
				add(i - 1, i, 1);
			}
		}
		sort(p + 1, p + n + 1, [](int x, int y){return a[x] < a[y];});
		for(int i = 2; i <= n; i++){
			if(b[p[i]] && b[p[i - 1]]){
				cnt -= 2;
				add(p[i], t, 1);
				add(p[i - 1], t, 1);
				add(p[i], p[i - 1], 1);
				add(p[i - 1], p[i], 1);
			}
		}
		cout << (cnt + dinic()) / 2 << "\n";
	}
	return 0;
}