#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 P = 998244353;
void solve() {
    int n, m;
    cin >> n >> m;
    vector<i64> a(n + 1), b(n + 1), nxt(n + 1, m + 1), lst(n + 1, m + 1), x(m + 1), t(m + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        b[i] = a[i];
    }
    for (int i = 1; i <= m; i++) cin >> x[i] >> t[i];
    for (int i = m; i > 0; i--) {
        nxt[i] = lst[t[i]];
        lst[t[i]] = i;
    }
    set<pair<int, int>> st;
    for (int i = 1; i <= n; i++) {
        st.insert({lst[i], i});
    }
    i64 pos = 0;
    for (int i = 1; i <= m; i++) {
        while (pos < x[i] && st.size()) {
            auto tmp = *st.begin();
            i64 d = min(x[i] - pos, a[tmp.second]);
            pos += d;
            a[tmp.second] -= d;
            if (a[tmp.second] == 0) {
                st.erase(tmp);
            }
        }
        while (st.size() && st.begin()->first <= i) {
            st.erase(st.begin());
        }
        if (pos == x[i]) {
            a[t[i]] = b[t[i]];
            st.insert({nxt[i], t[i]});
        }
    }
    for (int i = 1; i <= n; i++) pos += a[i];
    cout << pos << '\n';
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t = 1; 
    cin >> t;
    while(t--) solve();
    return 0;
}
/*
1
2 2
3 3
2 1
6 2
*/