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

void solve() {
    int n , m;
    cin >> n >> m;
    vector<int> a(n + 1);
    vector<int> b(n + 1);
    int sum = 0;
    for(int i = 1;i <= n;i ++) 
        cin >> a[i] , sum += a[i];
    vector<int> x(m + 1) , t(m + 1);
    vector<int> lst(n + 1) , nxt(m + 1);
    for(int i = 1;i <= m;i ++) 
        cin >> x[i] >> t[i];
    for(int i = m;i >= 1;i --) {
        nxt[i] = lst[t[i]];
        lst[t[i]] = i;
    }
    for(int i = 1;i <= n;i ++) 
        lst[i] = 0;
    priority_queue<int , vector<int> , greater<int> > pq;
    for(int i = 1;i <= m;i ++) {
        if(lst[t[i]] == 0) pq.push(i);
        lst[t[i]] = 1;
    }
    int now = 0;
    for(int i = 1;i <= m;i ++) {

        if(x[i - 1] + (sum - now) < x[i]) {
            cout << x[i - 1] + sum - now << "\n";
            return ;
        }

        int del = x[i] - x[i - 1];
        while(pq.size() && del >= (a[pq.top()] - b[pq.top()])) {
            int nb = pq.top();
            del -= (a[nb] - b[nb]);
            now += (a[nb] - b[nb]);
            b[nb] = a[nb];
            pq.pop();
        }

        if(pq.size() && del != 0) 
            b[pq.top()] += del;
        now += del;
        now -= b[t[i]];
        b[t[i]] = 0;

    }

    cout << x[m] + sum - now << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0) , cout.tie(0);
    int t; cin >> t;
    while(t --) solve();
    return 0;
}