#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
#define int long long
#define x first
#define y second
int a[N];
int b[N];
int c[N];
void slove()
{
	int ans = 0;
	int s = 0;
	int ss = 0;
	int n , m;
	cin >> n >> m;
	map<int ,int> k;
	for(int i = 1 ; i <= n ; ++ i)
	{
		cin >> a[i];
		s += a[i];
		ss += a[i];
	}
	for(int i = 1 ; i <= m ; ++ i)
	{
		cin >> b[i] >> c[i];
	}
	set<pair<int ,int>>p;
	for(int i = 1 ; i <= m ; ++ i)
	{
		if(ss < b[i]) break;
		p.insert({b[i - 1] + 1 , b[i]});
		int st = k[c[i]] + 1;
		int ma = a[c[i]];
		while(p.size())
		{
			auto kk = *p.lower_bound({st , 0});
			p.erase(kk);
			int l = kk.x;
			int t = kk.y;
			int dis = t - l + 1;
			if(ma < dis)
			{
				s += ma;
				p.insert({l + ma , t});
				break;
			}
			s += dis;
			ma -= dis;
			if(t == b[i]) break;
		}
		k[c[i]] = i;
	}
	cout << s << endl;
}
signed main()
{
	int t = 1;
	cin >> t;
	while(t --)
	{
		slove();
	}
}