#include<bits/stdc++.h>

#define MAXN 100005

using namespace std;

int n,m;
long long a[MAXN];
struct node
{
	long long x,t;
}b[MAXN];
int vis[MAXN];

int cmp(node a1,node b1)
{
	return a1.x<b1.x;
}

void solve()
{
	int i,j;
	cin>>n>>m;
	long long sum=0;
	for(i=1;i<=n;i++)
	{
		vis[i]=0;
		cin>>a[i];
		sum+=a[i];
	}
	for(i=1;i<=m;i++)
	{
		cin>>b[i].x>>b[i].t;
	}
	sort(b+1,b+1+m,cmp);
	int ov=0;
	bool flag=0;
	for(i=1;i<=m;i++)
	{
		if(ov+sum<b[i].x)
		{
			cout<<ov+sum<<endl;
			flag=1;
			break;
		}
		if(vis[b[i].t]==0)
		{
			int tmp=b[i].x-b[i-1].x;
			if(tmp>=a[b[i].t]) ov+=a[b[i].t];
			else ov+=tmp;
		}
		else
		{
			for(i=1;i<=n;i++)
			{
				int tmp=b[i].x-b[i-1].x;
				if(tmp>=a[b[i].t]) ov+=a[b[i].t];
				else ov+=tmp;
			}
		}
		vis[b[i].t]=b[i].x;
	}
	if(flag) return;
	cout<<ov<<" "<<sum<<endl;
	cout<<ov+sum<<endl;
}

int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int i,j;

	int T;
	cin>>T;
	while(T--)
		solve();

	return 0;
}