#include<bits/stdc++.h>

using namespace std;

#define pll pair<ll, ll>
#define ll long long
const int mod = 1e9 + 7;
const int N = 3e5 + 50;

struct Node
{
    ll a, b, c;
};
struct cmp 
{
    bool operator () (const Node& a, const Node& b)
    {
        return a.a > b.a;
    }
};

vector<ll> e[N];
ll tot[N], a[N], st[N], x[N], t[N], s[N];
ll n, m;

void solve()
{
    priority_queue<Node, vector<Node>, cmp> q;
    ll ans = 0;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        s[i] = a[i];
    }
    for (int i = 1; i <= m; i++) cin >> x[i] >> t[i];
    for (int i = 1; i <= m; i++)
    {
        e[t[i]].push_back(x[i]);
        if (st[t[i]] == 0)
        {
            st[t[i]] = 1;
            q.push({x[i], t[i], tot[t[i]]});
            //tot[t[i]] ++;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (st[i] == 0) q.push({(ll)1e18, i, 0});
    }
    for (int i = 1; i <= m; i++)
    {
        ll tx = x[i] - x[i - 1];
        while (tx > 0)
        {
            if (q.size() == 0) break;
            auto it = q.top();
            q.pop();
            if (it.c != tot[it.b]) continue;
            //cout << it.b << '\n';
            if (tx - s[it.b] > 0)
            {
                ans += s[it.b];
                tx -= s[it.b];
                s[it.b] = 0;
            }
            else
            {
                ans += tx;
                s[it.b] -= tx;
                tx = 0;
                if (s[it.b] > 0) q.push({it.a, it.b, it.c});
            }
        }
        if (tx > 0) break;
        tot[t[i]] ++;
        s[t[i]] = a[i];
        if (tot[t[i]] < e[t[i]].size()) q.push({e[t[i]][tot[t[i]]], t[i], tot[t[i]]});
        else q.push({(ll)1e18, t[i], tot[t[i]]});
    }
    //cout << ans << '\n';
    if (q.size() > 0)
    {
        for (int i = 1; i <= n; i++) ans += s[i];
    }
    cout << ans << '\n';

    for (int i = 0; i <= n + 10; i++)
    {
        e[i].clear();  tot[i] = 0;
        st[i] = 0;
    }
}

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