#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull long long
#define PII  pair<int ,int>
const int INF = 1145141919810;
const int mod = 1e9 + 7;
const int N = 1e5+5;
int fp(int a, int x, int mod) {
    int ans = 1;
    while (x) {
        if (x & 1)ans *= a;
        ans %= mod;
        a *= a;
        a %= mod;
        x >>= 1;
    }
    return ans;
}
bool check1(int n) {
    for (int i = 2; i <= n / 2; i++) {
        if (n % i == 0)return 0;
    }
    return 1;
}
struct tree {
    int sum, pre, suf;
    int tag = -1;
};
tree tr[4 * N];
int ls(int p) { return p << 1; }
int rs(int p) { return (p << 1) + 1; }
int history[N], tot = 0;
void add_tag(int p, int d, int pl, int pr) {
    tr[p].tag += d;
    tr[p].sum += d*(pr-pl+1);
}
void push_down(int p, int len) {
    if (tr[p].tag != -1) {
        tr[ls(p)].tag = tr[rs(p)].tag = tr[p].tag;
        tr[ls(p)].pre = tr[ls(p)].sum = (tr[p].tag == 0) ? 0 : (len - (len >> 1));
        tr[rs(p)].pre = tr[rs(p)].sum = (tr[p].tag == 0) ? 0 : (len >> 1);
        tr[p].tag = -1;
    }
}
void push_up(int p, int len) {
    tr[p].pre = tr[ls(p)].pre;
    tr[p].suf = tr[rs(p)].suf;
    if (tr[ls(p)].pre == (len - (len >> 1))) {
        tr[p].pre = tr[ls(p)].pre + tr[rs(p)].pre;
    }
    if (tr[rs(p)].suf == (len >> 1)) {
        tr[p].suf = tr[rs(p)].suf + tr[ls(p)].suf;
    }
}
void build(int pl, int pr, int p) {
    tr[p].tag = -1;
    if (pl == pr) {
        tr[p].sum = tr[p].pre = tr[p].suf = 1;
        return;
    }
    int mid = (pl + pr) >> 1;
    build(pl, mid, ls(p));
    build(mid + 1, pr, rs(p));
    push_up(p, pr - pl + 1);
}

void update(int L,int R, int c, int p, int pl, int pr) {
    if (L <= pl && R >= pr) {
        tr[p].pre=tr[p].suf=tr[p].sum = (c == 0) ? 0 : pr - pl + 1;
        tr[p].tag = c;
        return;
   }
    int mid = (pl + pr) >> 1;
    if (L <= mid)update(L, R, c, ls(p), pl, mid);
    if (R > mid)update(L, R, c, rs(p), mid + 1, pr);
    //else update(x, c, rs(p), mid + 1, pr);
    push_up(p, pr - pl + 1);
}

int query(int len, int p, int pl, int pr) {
    if (pl == pr)return pl;
    int mid = (pl + pr) >> 1;
    if (len <= tr[ls(p)].sum) {
        if (len <= tr[p].pre)return pl;
        else return query(len, ls(p), pl, mid);
    }
    else if (len <= tr[rs(p)].pre + tr[ls(p)].suf) {
        return mid - tr[ls(p)].suf + 1;
    }
    else if (len <= tr[rs(p)].sum) {
        if (len <= tr[rs(p)].pre)return pl;
        else return query(len, rs(p), mid+1, pr);
    }

}


struct print{
    int s, x;
    bool operator<(const print a)const {
        if (a.s != s)return a.s > s;
       else return a.x< x;
    }
};
print a[N];
int b[N];
int c[N];
map<int, int>q;
void solve() {
    int n, m;
    cin >> n >> m;
    int sum = 0;
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
        c[i] = b[i];
        sum += b[i];
    }
    for (int i = 1; i <= m; i++) {
        cin >> a[i].s >> a[i].x;
    }
    sort(a + 1, a + 1 + m);
    int now = 0;
    for (int i = 1; i <= m; i++) {
        if (sum < a[i].s-now) {
            ans += sum;
            cout << ans << endl;
            return;
        }
        int x = a[i].x;
        if (a[i].x >= a[i].s-now) {
            now = a[i].s;
            ans = a[i].s;
        }
        else {
            int p = 0;
            int j = i;
            while (p < a[i].s - now&&j<=m) {
                if (q.count(a[j].x) == 0) {
                    int di = min(c[a[j].x], a[i].s - now - p);
                    p += di;                  
                    c[a[j].x] -= di;
                    sum -= di;
                    if (c[a[j].x] == 0)q[a[j].x]++;
                }
                j++;
            }
          //j = 0;
            int k = 1;
            bool f = 1;
            while (p < a[i].s - now ) {
                if (q.count(k) == 0) {
                    int di = min(c[k], a[i].s - now - p);
                    p += di;                   
                    c[k] -= di;
                    sum -= di;
                    if (c[k] == 0)q[k]++;
                }
                k++;
            }
       
            if (q.count(a[i].x) == 0) {
                sum += b[a[i].x] - c[a[i].x];
                ans = a[i].s;
                now = a[i].s;
                c[a[j].x] = b[a[j].x];
            }
            else {
                sum += b[a[i].x];
                ans = a[i].s;
                now = a[i].s;
                c[a[i].x] = b[a[i].x];
                q.erase(a[i].x);
            }
        }
    }
    ans += sum;
    cout << ans << endl;
}

//&&(((sum[n]+k)%mid==0)||(sum[n]/mid!=(sum[n]+k)/mid)||(mid-(sum[n]%mid)>=k))
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    //while (t--) {
    //    //if (k == 100000)cout << k - t + 1 << " ";
    //    solve();
    //}
}