#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define int ll
using namespace std;
typedef vector<int> VI;
typedef unsigned long long ULL;
const int N=1e6+7;
const int inf=1e18+7;
const int mod=1e9+7;
int n,m;
int a[N];
int vis[N];
pair<int,int> p[N];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
set<int> st[N];
void solve()
{
    cin>>n>>m;
    int tot=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        vis[i]=a[i];
        tot+=a[i];
    }
    for(int i=1;i<=m;i++)
    {
        cin>>p[i].first>>p[i].second;
        q.push({p[i].first,p[i].second});
    }
    sort(p+1,p+1+m);
    int s=0;
	for(int i=1;i<=m;i++)
	{
		int ts=p[i].first-p[i-1].first;
		while(!q.empty()&&ts>0)
		{
			auto x=q.top();
			q.pop();
			int pos=x.first,id=x.second;
			st[id].insert(pos);
			if(ts>=vis[id])
			{
				s+=vis[id];
				tot-=vis[id];
				ts-=vis[id];
				vis[id]=0;
			}
			else 
			{
				s+=ts;
				vis[id]-=ts;
				tot-=ts;
				ts=0;
			}
		}
		if(ts>0)
		{
			if(tot>=ts) 
			{
				tot-=ts;
				s+=ts;
				ts=0;
			}
			else 
			{
				ts-=tot;
				s+=tot;
				tot=0;
				//break;
			}
		}
		if(ts!=0) break;
		int cid=p[i].second;
		tot+=(a[cid]-vis[cid]);
		vis[cid]=a[cid];
		while(!st[cid].empty())
		{
			int x=*st[cid].begin();
			st[cid].erase(x);
			if(x>p[i].first)
			{
				q.push({x,cid});
				//break;
			}
		}
	}
	cout<<s+tot<<'\n';
	while(!q.empty()) q.pop();
	for(int i=1;i<=n;i++)
	{
		st[i].clear();
	}
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int TT=1;
     cin>>TT;
    while(TT--)
    {
        solve();
    }
    return 0;
}