#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 3;
int T;
int n, num;

typedef long long ll;
void work(){
	int n,m;cin >> n >> m;
	vector <ll> a(n),vis(n);
	for(auto &x : a) cin >> x;
	vector <ll> c = a;
	vector <pair <ll,ll>> b(m);
	for(auto &[x,y] : b) {
		cin >> x >> y,y -= 1;
		vis[y] = 1;
	}
	b.push_back({1e18,0});
	ll sum = 0;
	for(int i = 0;i < n;i++) if(!vis[i]) {
		sum += a[i];
		a[i] = 0;
	}
	multiset <int> st;
	int j = 0;
	ll pos = 0;
	for(int i = 0;i < m;i++) {
		j = max(j,i);
		while(j < m) {
			ll val = min(a[b[j].second],b[i].first - pos);
			pos += val;
			a[b[j].second] -= val;
			if(a[b[j].second]) break;
			st.insert(b[j].second);
			j += 1;
		}
//		cout << j << ' ' << << '\n';
		ll dis = min(b[i].first - pos,sum);
		pos += dis;
		sum -= dis;
		if(st.find(b[i].second) != st.end()) st.erase(st.find(b[i].second));
		a[b[i].second] = c[b[i].second];
		if(st.find(b[i].second) != st.end()) {
			dis = min(a[b[i].second],b[i + 1].first - b[i].first);
			pos += dis;
			a[b[i].second] -= dis;
		}
	}
	for(int i = 0;i < n;i++) pos += a[i];
	cout << pos + sum << '\n';

}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> T;
	while(T--){
		work();
	}	
	return 0;
}