#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 strc {
    int c, nxt, id;
    bool operator<(const strc a)const {
        return nxt > a.nxt;
    }
};
int a[N];
queue<int>p[N];
PII b[N];
priority_queue<strc>q1, q2;
void solve() {
    int n, m;
    cin >> n >> m;
    int sum = 0;
    int ans = 0;

    while (!q1.empty())q1.pop();
    while (!q2.empty())q2.pop();
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        b[m + i] = { INF,INF };
        while (!p[i].empty())p[i].pop();
    }
    for (int i = 1; i <= m; i++) {
        cin >> b[i].first >> b[i].second;
    }
    sort(b + 1, b + 1 + m);
    for (int i = 1; i <= m; i++) {
        p[b[i].second].push(i);
    }
    for (int i = 1; i <= n; i++) {
        p[i].push(m + 1);
        q1.push({ a[i],p[i].front(),i});
        p[i].pop();
    }
    int now = 0;
    int s = 0;
    while (!q1.empty()&&now<=m) {
        strc xx = q1.top();
        q1.pop();
        if (s + xx.c>=b[now+1].first) {
            int nowc = xx.c -(b[now + 1].first - s);
            if(nowc==0){
                if (!p[xx.id].empty()) {
                    q2.push({ a[xx.id],p[xx.id].front(),xx.id});
                    p[xx.id].pop();
                }
            }
            else {
                q1.push({ nowc, xx.nxt, xx.id });
            }
            s = b[now + 1].first;
            if (q1.empty()) {
                q1.push(q2.top());
                q2.pop();
            }
            else if (q1.top().id == b[now + 1].second) {
                strc tt = q1.top();
                q1.pop();
                if (!p[tt.id].empty())
                {
                    q1.push({ a[tt.id],p[tt.id].front(),tt.id});
                    p[tt.id].pop();
                }
            }
            else {
                q1.push(q2.top());
                q2.pop();
            }
            now++;
        }
        else {
            s += xx.c;
            if (!p[xx.id].empty()) {
                q2.push({ a[xx.id],p[xx.id].front(),xx.id});
                p[xx.id].pop();
            }
        }
    }
    cout << s << 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();
    //}
}