#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
#include <numeric>
#include <cmath>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <string>
#define int long long
#define ll long long
#define pii pair<int,int>
#define piii pair<pii,int>
using namespace std;
const int inf = (1ll << 60) - 1 + (1ll << 60);
const int maxn = 2e5 + 5;
const int maxm = 2e5 + 5;
int dx[] = { 0,0,1,-1 }, dy[] = { 1,-1,0,0 };



void solve() {
    int n, m;
    cin >> n >> m;
    int sum = 0;
    vector<int> a(n + 1), las(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum += a[i];
    }
    vector<int> p(m + 1), t(m + 1);
    for (int i = 1; i <= m; i++) {
        cin >> p[i] >> t[i];
    }
    map<int, int> mp;
    set<int> st;
    for (int i = 1; i <= m; i++) {
        int need = p[i] - p[i - 1];
        if (sum < need) {
            cout << p[i - 1] + sum << "\n";
            return;
        }
        else {
            sum -= need;
            st.insert(i);
            mp[i] = need;
        }
        auto it = st.upper_bound(las[t[i]]);
        int x = 0;
        while (it != st.end()) {
            x += mp[*it];
            int y = *it;
            it++;
            st.erase(y);
            if (x >= a[t[i]]) {
                if (x > a[t[i]]) {
                    mp[y] = x - a[t[i]];
                    x = a[t[i]];
                    st.insert(y);
                }
                break;
            }
        }
        sum += x;
    }
    cout << p[m] + sum << "\n";
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}