#include<bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
typedef long long ll;

struct node{
    ll pos;
    int id,f;
     bool operator<(const node & a) const {
        return pos > a.pos;//重载，从小到大排序
    }
}b[N];

int n,m;
int x[N],t[N];
ll a[N],ora[N];
vector<int>e[N];
int num[N];
int now[N];

void solve(){
    priority_queue<node>q;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        ora[i] = a[i];
        e[i].clear();
        num[i] = 0;
    }
    for(int i = 1; i <= m; i++){
        cin >> x[i] >> t[i];
        e[t[i]].push_back(x[i]);
        now[i] = num[t[i]];
        num[t[i]]++;
    }
    ll sum = 0;
    for(int i = 1; i <= n; i++){
        if(num[i] == 0){
            sum += a[i];
            a[i] = 0;
            continue;
        }
        q.push({e[i][0],i,0});
    }
    ll ans = 0;
    for(int i = 1; i <= m; i++){
        int id = t[i];
        int pos = x[i];
        while(!q.empty()){
            auto tx = q.top();
            q.pop();
            int j = tx.id;
            if(tx.f + 1 < num[j])
                q.push({e[j][tx.f + 1],j,tx.f + 1});
            if(a[j] >= pos - ans){
                a[j] -= (pos - ans);
                ans = pos;
                break;
            }
            else{
                ans += a[j];
                a[j] = 0;
            }
        }
        if(pos == ans){
            a[id] = ora[id];
            if(now[i] + 1 >= num[id]){
                sum += a[id];
                a[id] = 0;
            }
        }
        else if(pos <= ans + sum){
            sum -= (pos - ans);
            a[id] = ora[id];
            ans = pos;
        }
        else{
            break;
        }
    }
    for(int i = 1; i <= n; i++){
        ans += (ll)a[i];
    }
    ans += sum;
    cout << ans << "\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T = 1;
    cin >> T;
    while(T--){
        solve();
    }
}