#include <bits/stdc++.h>
using namespace std;
#define lll i << 1
#define rrr i << 1 | 1


//
 #define ll long long
 #define int long long
	#define ld long double
	#define rint register int
	#define inv inline void
	#define ini inline int
//    inline int read()
//    {
//        int sum=0;
//        char ch=getchar();
//        while(ch>'9'||ch<'0') ch=getchar();
//        while(ch>='0'&&ch<='9') sum=sum*10+ch-48,ch=getchar();
//        return sum;
//    }//读入优化
//	
//    
//    inline void print(int x){
//        if(!x){
//            putchar('0');
//            return;
//        }
//        int num[22],siz=0,px=x;
//        while(px){
//            siz++;
//            num[siz]=px%10;
//            px/=10;
//        }
//        while(siz){
//            putchar(num[siz]+'0');
//            siz--;
//        }
//    }   //快速输出
      __int128 read() {
	char arr[30];
	__int128 res = 0;
	scanf("%s", arr);
	for (int i = 1; i <= strlen(arr); i++) {
		res *= 10;
		res += arr[i]-'0';
	}
	return res;
}
void print (__int128 num) {
	if (num > 9) { print(num / 10); }
	putchar(num % 10 + '0');
}
      
      
      
    long long max(long long a,long long b)
    {
       return a>b?a:b;
    }
      
    long long min(long long a,long long b)
    {
       return a<b?a:b;
    }
     
      
    const int N=1e5+6;
    const int N2=1004; 
    int mod=1000000007;
    //int Mod=1e15+7;
    const int INF=2e17;
  	const double eps=1e-10;
 	const double PI=3.1415926535;
//priority_queue<int , vector<int >, greater<int >> q;
//priority_queue<int > q;
//map<string ,int>mp,mmp;
 //typedef pair<int ,int > PII;
//stack < PII > p;
 
//queue<int > q;
//char s1[2020],s2[2020];
//vector<vector<int>> c(n+13,vector<int>(m+3));
//map<int,int>mp;
 
//priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > >q[1001][1001],p;
 //a.erase(unique(a.begin(), a.end()), a.end());
//char p,q;
//char s[N];
//deque<int > q;
//queue<int> q;
//using ull = unsigned long long;
//ull mod=212370440130137957ll;

int ma,mi;
int  n,m;

//int f[N][N],a[N][N],b[N][N],c[N][N],dp[N][N],q[N],v[N][N];

//
//struct node
//{
//	
//	double x,y,z;
//	
//}p[N];
//
//inline bool cmp(node w,node v)
//{
//	if(w.x==v.x)
//		return w.y<v.y;
//		
//	return w.x<v.x;	
//}

//
//int fx[5]={-1,0,0,1};
//int fy[5]={0,-1,1,0};


//int q[N],q2[N];


//知道3边，判断是否可以组成三角形 
bool check(int x,int y,int z) 
{
	if(x+y>z&&x+z>y&&y+z>x) return 1;
	return 0;
}
//知道3边，求三角形面积 
double df(double x,double y,double z)
{
	double p=(x+y+z)/2;
	return sqrt(p*(p-x)*(p-y)*(p-z));
}

char ss[N];

signed main()
{
	std::ios::sync_with_stdio(false);//取消cin与stdin同步,加速读入 
	cin.tie(0);cout.tie(0);
 	int t;
 	t=1;
 	//string s;
	cin>>t;

	while(t--)
	{
		int tt=0,fa=0,ans=0;
		//int   res=0,ans=0.0;
		//ma=0,mi=2e17;
		//map<int,int> mp,mp2;
		cin>>n>>m;
		vector<int> a(n+2),la(n+2),fi(n+2),ne(n+2),x(m+2),y(m+2),now(n+2);
		set<pair<int,int > > se;
		for(int i=1;i<=n;i++)
		{
			cin>>a[i];
			now[i]=a[i];
		}
		
		for(int i=1;i<=m;i++)
		{
			cin>>x[i]>>y[i];
			if(!fi[y[i]])
			{
				fi[y[i]]=i;
			}	
			if(la[y[i]])
			{
				ne[la[y[i]]]=i;
			}			
			la[y[i]]=i;
		}	
		
		for(int i=1;i<=m;i++)
		{
			if(!ne[i])
			{
				ne[i]=m+1;
			}
		}
		
		for(int i=1;i<=n;i++)
		{
			if(fi[i])
			{
				se.insert({fi[i],i});
			}
			else
			{
				se.insert({m+1,i});
			}
		}
		int dis=0,res=0;
		for(int i=1;i<=m;i++)
		{
			res=x[i]-x[i-1];
			while(se.size()&&res>=now[se.begin()->second])
			{
				res-=now[se.begin()->second];
				
				ans+=now[se.begin()->second];
				now[se.begin()->second]=0;
				se.erase(se.begin());
			}
			if(res&&se.empty())
			{
				
				break;
			}
			
			now[se.begin()->second]-=res;
			
			if(se.find({i,y[i]})!=se.end())
				se.erase({i,y[i]});
			se.insert({ne[i],y[i]});
			
			now[y[i]]=a[y[i]];
	
			ans+=res;
			
		//	cout<<ans<<"\n";
		}
		while(se.size())
		{
			ans+=now[se.begin()->second];
			se.erase(se.begin());
		}
		cout<<ans;
		cout<<"\n";
	}
	
    return 0;
}