#include<bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e5 + 10;

int T;
int n, m;
int nxt[N];
struct Battery{
    int lef, v, pos = INT_MAX, id;
    bool operator <(const Battery &x)const {
        return x.pos < pos;
    }
}a[N];
struct Charger{
    int x, t;
}b[N];

map<int, int>las;
priority_queue<Battery>q;
priority_queue<Battery>emp;
void solve() {
    scanf("%lld%lld", &n, &m);
    for(int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i].v);
        a[i].lef = a[i].v; a[i].id = i;
        a[i].pos = INT_MAX;
    }
    for(int i = 1; i <= m; ++i) nxt[i] = 0;
    for(int i = 1; i <= m; ++i) {
        scanf("%lld%lld", &b[i].x, &b[i].t);
        if(a[b[i].t].pos == INT_MAX) {
            a[b[i].t].pos = i;
        }    
        if(las.find(b[i].t) != las.end()) {
            nxt[las[b[i].t]] = i;
        }
        las[b[i].t] = i;
    }
    
    for(int i = 1; i <= n; ++i) {
        q.push(a[i]);
    }
    int now = 0;
    for(int i = 1; i <= m; ++i) {
        Battery c = q.top();
        bool flag = 0;
        while(!q.empty()) {
            c = q.top(); q.pop();
            //printf("%lld %lld %lld\n", c.lef, c.id, c.pos);
            if(now + c.lef >= b[i].x) {
                flag = 1; break;
            }
            else {
                now += c.lef;
                c.lef = 0;
                emp.push(c);
            }
        }
        if(!flag && q.empty()) {
            break;
        }
        if(c.id == b[i].t) {
            c.lef = c.v; 
            c.pos = nxt[i] == 0 ? INT_MAX : nxt[i];
            now = b[i].x;
            q.push(c);
        }
        else {
            c.lef -= b[i].x - now;
            now = b[i].x;
            if(c.lef == 0) emp.push(c);
            else q.push(c);
            if((!emp.empty()) && emp.top().id == b[i].t) {
                Battery tmp = emp.top();
                tmp.pos = nxt[i] == 0 ? INT_MAX : nxt[i];
                tmp.lef = tmp.v; q.push(tmp);
            }
            
        }
    } 
    while(!q.empty()) {
        now += q.top().lef;
        q.pop();
    }
    while(!emp.empty()) emp.pop();
    las.clear();
    printf("%lld\n", now); 
}

signed main() {
    scanf("%lld", &T);
    while(T--) solve();
}