#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+10;
ll a[N];
ll x[N];
ll t[N];
ll dp[N];
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    int T;
    cin>>T;
    while(T--)
    {
        int n,m;
        cin>>n>>m;
        ll sum = 0;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            sum += a[i];
        }
        for(int i=1;i<=m;i++)
        {
            cin>>x[i]>>t[i];
        }
        bool flag = 0;
        int ans = m;
        for(int i=1;i<=m;i++)
        {
            if(sum + dp[i-1]>=x[i])
            {
                dp[i] = min(dp[i-1] + a[t[i]],x[i]);
            }else
            {
                flag=1;
                ans = i;
            }
        }
        cout<<dp[ans]+sum<<endl;
    }
    return 0;
}