#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
#define x first
#define y second
using namespace std;

typedef long long LL;
typedef pair<int,int> PII; 
const int N=100010;
int n,m;
int a[N],c[N];
PII b[N];

int main() {
	int T;
	cin>>T;
	while(T--){
		cin>>n>>m;
		queue<int> h[n+10];
		priority_queue<PII,vector<PII>,greater<PII>> pq;
		for(int i=1;i<=n;++i){
			cin>>a[i];
		}
		for(int i=1;i<=m;++i){
			cin>>b[i].x>>b[i].y;
			h[b[i].y].push(i);
		}
		for(int i=1;i<=n;++i){
			if(h[i].size()){
				int t=h[i].front();
				h[i].pop();
				pq.push({t,a[i]});
			}
			else{
				pq.push({1e9,a[i]});
			}
		}
		LL now=0;
		for(int i=1;i<=m;++i){
			while(pq.size()&&pq.top().x<i) pq.pop();
			while(pq.size()&&now<b[i].x){
				PII t=pq.top();
				pq.pop();
				int tmp=min(b[i].x-now,(LL)t.y);
				now+=tmp;
				t.y-=tmp;
				if(t.y){
					pq.push(t);
				}
			}
			if(now==b[i].x){
				if(h[b[i].y].size()){
					int t=h[b[i].y].front();
					h[b[i].y].pop();
					pq.push({t,a[b[i].y]});
				}
				else{
					pq.push({1e9,a[b[i].y]});
				}
			}
		}
		while(pq.size()&&pq.top().x<=n) pq.pop();
		while(pq.size()){
			PII t=pq.top();
			cout<<t.y<<endl;
			pq.pop();
			now+=t.y;
		}
		cout<<now<<endl;
	}
	return 0;
}