#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> PII;
#define endl "\n"
#define ft first
#define sd second
#define pb push_back
const int MOD = 1e9 + 7;
int n,m;
const int N = 1e5 + 10;
int a[N],c[N];
PII b[N];
void solve() {
    cin>>n>>m;
    int sum = 0;
    for(int i = 1;i <= n;i++) {
        cin>>a[i];
        c[i] = a[i];
        sum +=a[i];
    }
    map<int,int> mp;
    priority_queue<PII,vector<PII>,greater<PII> > q;
    map<int,vector<int>> mp1;
    for(int i = 1;i <= m;i++){
        int x,y; cin>>x>>y;
        b[i] = {x,y};
        if (!mp.count(y)) {
            q.push(b[i]);
        }
        mp1[y].pb(x);
    }
    int now = 0;
    b[0] = {0,0};
    for(int i = 1;i <= m;i++){
        int d = b[i].ft - b[i - 1].ft;
        if(sum >= d){
            sum -=d;
            now +=d;
            while(q.size() && d){
                auto t = q.top();q.pop();
                int id = t.sd;
                if(d >= a[id]){
                    d -=a[id];
                    a[id] = 0;
                }
                else {
                    a[id] -= d;
                    d = 0;
                }
            }
            int id1 = b[i].sd;
            int dx = c[id1] - a[id1];
//            cout<<id1<<' '<<c[id1]<<' '<<a[id1]<<endl;
//            cout<<sum<<' '<<now<<endl;
            sum +=dx;
            a[id1] = c[id1];
//            cout<<sum<<endl;
            auto &v = mp1[id1];
            if (v.size()) v.erase(v.begin());
            if(v.size()) q.push({v[0],id1});
        }
        else break;
    }
    now +=sum;
    cout<<now<<"\n";
    return ;
}
signed main() {
//    ios::sync_with_stdio(0);
//    cin.tie(0);
//    cout.tie(0);
    int T = 1;
    cin>>T;
    while(T--)
        solve();
    return 0;
}
/*
2
3 1
3 3 3
8 1
2 2
5 2
1 2
2 1


1
3 2
2 2 2
6 1
7 1

 */