#include <iostream>
#include <vector>
#include <queue>
#define ll long long
#define int long long
#define inf 100000000
#define mod 998244353
using namespace std;

ll a[200005];
ll b[200005];
ll last[200005];
vector<vector<ll>> Time(200005);
void solve(){
    int n, m;
    cin >>n >> m;
    vector<pair<ll, ll>> recharge(m + 1);
    ll sum = 0;
    for(int i = 1; i <= n; i++){
        Time[i].clear();
        cin >> a[i];
        sum += a[i];
        b[i] = a[i];
    }
    priority_queue<pair<ll, ll>, vector<pair<ll, ll>> , greater<pair<ll, ll>> > pq;
    
    for(int i = 1; i <= m; i++){
        cin >> recharge[i].first>> recharge[i].second;
        Time[recharge[i].second].push_back(i);
        if(Time[recharge[i].second].size() == 1){
            pq.push({i, 0});
        }
        
    }
    for(int i = 1; i <= n; i++){
        if(Time[i].size() > 0 ){
            
            sum -= a[i];
        }
        else{
            
        }
    }
    int cur = 0;
    for(int i = 1; i <=m ; i++){
        int s = recharge[i].first - cur;
        int id = pq.top().second;
        while(!pq.empty()){
            int idx = pq.top().first;
            int nxt = pq.top().second;
            int pos = recharge[idx].second;
            
            pq.pop();
            if(s < b[pos]){
                b[pos] -= s;
                cur += s;
                s = 0;
                
                if(idx != i){
                    
                    pq.push({idx, nxt});
                }
                
                break;
            }
            else{
                cur += b[pos];
                s -= b[pos];
                b[pos] = 0;
                
            } 
        }
        if(s > 0){
            if(sum >= s){
                sum -= s;
            }
            else{
                cur += sum;
                
                sum = 0;
                break;
            }
        }
        cur = recharge[i].first;
        if(Time[recharge[i].second].size() -1 == id){
            sum += a[recharge[i].second];
        }
        else{
            
            pq.push({Time[recharge[i].second][id+ 1], id + 1});
            b[recharge[i].second] = a[recharge[i].second];
        }

    }
    while(!pq.empty()){
        int id = pq.top().first;
        pq.pop();
        cur += b[recharge[id].second];
    }
    cout << cur + sum << endl;
    
    
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    
     
}