#include <iostream>
#include<cstdio>
#define LSOne(S) (S & (-S))
using namespace std;
int n;
int ft[100009]={0};
void update(int k,int v)
{
	for(;k<=n;k+=LSOne(k));
	ft[k]+=v;
}
void range_update(int l,int r,int val)
{
	update(l,val);
	update(r+1,-val);
 
}
long long int query(int b)
{
	long long int sum=0;
	for (; b; b -= LSOne(b))
	sum += ft[b];
	return sum;
}
int main() {
	// your code goes here
 
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int u;
		scanf("%d%d",&n,&u);
		while(u--)
		{
			int l,r,val;
			scanf("%d%d%d",&l,&r,&val);
			range_update(l+1,r+1,val);
		}
		int q;
		scanf("%d",&q);
		while(q--)
		{
			int index;
			scanf("%d",&index);
			cout<<query(index+1)<<endl;
		}
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxjc3RkaW8+CiNkZWZpbmUgTFNPbmUoUykgKFMgJiAoLVMpKQp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbjsKaW50IGZ0WzEwMDAwOV09ezB9Owp2b2lkIHVwZGF0ZShpbnQgayxpbnQgdikKewoJZm9yKDtrPD1uO2srPUxTT25lKGspKTsKCWZ0W2tdKz12Owp9CnZvaWQgcmFuZ2VfdXBkYXRlKGludCBsLGludCByLGludCB2YWwpCnsKCXVwZGF0ZShsLHZhbCk7Cgl1cGRhdGUocisxLC12YWwpOwoJCn0KbG9uZyBsb25nIGludCBxdWVyeShpbnQgYikKewoJbG9uZyBsb25nIGludCBzdW09MDsKCWZvciAoOyBiOyBiIC09IExTT25lKGIpKQoJc3VtICs9IGZ0W2JdOwoJcmV0dXJuIHN1bTsKfQppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCSAKCWludCB0OwoJc2NhbmYoIiVkIiwmdCk7Cgl3aGlsZSh0LS0pCgl7CgkJaW50IHU7CgkJc2NhbmYoIiVkJWQiLCZuLCZ1KTsKCQl3aGlsZSh1LS0pCgkJewoJCQlpbnQgbCxyLHZhbDsKCQkJc2NhbmYoIiVkJWQlZCIsJmwsJnIsJnZhbCk7CgkJCXJhbmdlX3VwZGF0ZShsKzEscisxLHZhbCk7CgkJfQoJCWludCBxOwoJCXNjYW5mKCIlZCIsJnEpOwoJCXdoaWxlKHEtLSkKCQl7CgkJCWludCBpbmRleDsKCQkJc2NhbmYoIiVkIiwmaW5kZXgpOwoJCQljb3V0PDxxdWVyeShpbmRleCsxKTw8ZW5kbDsKCQl9Cgl9CglyZXR1cm4gMDsKfQ==

MQo1IDMKMCAxIDcKMiA0IDYKMSAzIDIKMwowCjMKNAo=

1
5 3
0 1 7
2 4 6
1 3 2
3
0
3
4