// Problem: A - New Energy Vehicle
// Contest: Virtual Judge - 思维
// URL: https://vjudge.net/contest/670080#problem/A
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

// #pragma GCC optmize("Ofast")
#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 2e5 + 10, M = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;

int n, m, q, ans;
int s[N], dp[N], cy[N], lst[N], nxt[N];
bool vis[N];
PII p[N];

vector<int> e[N];
list<PII> v;

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int T; cin >> T;
	while(T --)
	{
		priority_queue<PII, vector<PII>, greater<> > pq;
		cin >> n >> m; int sum = 0, tag = 0; bool flag = false;
		for(int i = 1; i <= n; i ++) lst[i] = -1, nxt[i] = -1;
		// for(int i = 1; i <= n; i ++) vis[i] = false;
		for(int i = 1; i <= n; i ++) {cin >> s[i]; cy[i] = s[i];}
		for(int i = 1; i <= m; i ++) cin >> p[i].fi >> p[i].se; 
		for(int i = m; i; i --)
		{
			if(~lst[p[i].se]) nxt[i] = lst[p[i].se], lst[p[i].se] = i;
			else lst[p[i].se] = i;
			pq.push({i, p[i].se});
		}
		for(int i = 1; i <= n; i ++) pq.push({INF, i});
		for(int i = 1; i <= m; i ++)
		{
			int dis = p[i].fi - p[i - 1].fi;
			while(!pq.empty() && dis)
			{
				while(pq.top().fi < i) {pq.pop(); continue;}
				int now = pq.top().se, id = pq.top().fi;
				// cout << "dis = " << dis << " now = " << now << " left = " << s[now] << '\n';
				if(s[now] > dis) s[now] -= dis, dis = 0;
				else 
				{
					dis -= s[now], s[now] = 0; pq.pop();
					if(id == INF) continue;
					// cout << "id = " << id << " nxt = " << nxt[id] << '\n'; 
					if(~nxt[id]) v.push_back({nxt[id], now});
					else v.push_back({INF, now});
				}	
			}
			// cout << "dis = " << dis << '\n';
			if(dis) 
			{
				cout << p[i].fi - dis << '\n'; 
				flag = true; 
				break;
			}
			s[p[i].se] = cy[p[i].se];
			for(auto j : v) pq.push(j); 
			v.clear();
		}
		if(flag) continue;
		for(int i = 1; i <= n; i ++) sum += s[i];
		cout << p[m].fi + sum << '\n';
		// if(!flag) cout << p[m].fi + (sum - tag) << '\n';
	}	
	return 0;
}