/*Time:2024-11-13 15:52:45*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define second se
#define first fi
#define vi vector<int>
#define vvi vector<vi>
#define all(v) v.begin(),v.end()
const int MOD = (int) 1e9 + 7;
const int INF = INT_MAX;
// const int MAXN = 


void solve() {
	int n,m;
	cin >> n >> m;
	vi v(n+1),a(n+1),dis(n+1),b(n+1),able;
	for(int i = 1;i<=n;i++){
		cin >> v[i];
		a[i] = v[i];
	}
	for(int i = 1;i<=m;i++){
		cin >> dis[i] >> b[i];
		able.push_back(b[i]);
	}
	for(int i=1;i<=n;i++){
		able.push_back(i);
	}
	int M = able.size();
	vi cnt(n+1,0);
	int now = 0,j = -1;
	int sp = 0;
	for(int i = 1;i<=m;i++){
		// while((j==-1 || a[able[j]] == 0) && j<M){
		// 	j++;
		// 	cnt[able[j]]++;
		// }
		// if(j==M)break;
		j=max(j,i);
		if(j==M)break;
		while(now < dis[i]){
			while((j==-1 || a[able[j]] == 0) && j<M){
				j++;
				// cnt[able[j]]++;
			}
			if(j==M)break;
			int t = min(dis[i]-now,a[able[j]]);
			a[able[j]] -= t;
			now += t;
		}

		if(now>=dis[i])a[b[i]] = v[b[i]];
		if(j==M)break;
		// cout << now << endl;
	}
	for(int i=1;i<=n;i++){
		now+=a[i];
	}
	cout << now << endl;
}

int32_t main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << fixed << setprecision(12);
    int T = 1;
    cin >> T;
    while (T--)solve();
}