#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long,long long>
#define FF fflush(stdout)
#define inf 0x3f3f3f3f
#define endl "\n"
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
bool Memory_begin;

/*

*/

bool Memory_end;
queue<int> li[100005];
bool in[100005];

signed main()
{
    // ios_base::sync_with_stdio(false);
    // cin.tie(nullptr);

    // cerr << (&Memory_end - &Memory_begin) / 1048576.0 << "MB" << '\n';

    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        vector<int> a(n);
        for (int i = 0; i < n; i++)
            cin >> a[i];
        auto c = a;
        vector<pair<int, int>> b(m);
        vector<int> lst(n, -1);
        for (int i = 0; i < m; i++)
        {
            cin >> b[i].first >> b[i].second, b[i].second -= 1;
            lst[b[i].second] = i;
            li[b[i].se].push(i);
        }
        vector<vector<int>> pos(m + 1);
        for (int i = 0; i < n; i++)
            pos[lst[i] + 1].push_back(i);

        long long ans = 0, remain = 0;
        int pre = 0;
        priority_queue<int,vector<int>,greater<int> > p;
        for(int i=0;i<n;i++)
        if(li[i].size())p.push(li[i].front()),li[i].pop();
        for (int i = 0; i < m; i++)
        {//cout<<i<<endl;
            while(p.size()&&p.top()<i)
            {
                int id=b[p.top()].se;
                p.pop();
                if(li[id].size())
                p.push(li[id].front()),li[id].pop();
                else in[id]=0;
            }
            for (auto &id : pos[i])
                remain += a[id], a[id] = 0;
            while (pre < b[i].first)
            {
                if(p.size())
                {
                    int id=b[p.top()].second;
                    int tmp = b[i].first - pre;
                    int u = min(tmp, a[id]);
                    ans += u, a[id] -= u, pre += u;
                    if(!a[id])p.pop(),in[id]=0;
                    if (pre == b[i].first)
                        break;
                    // if(li[id].size())
                    // p.push(mp(b[li[id].front()].first,id)),li[id].pop();
                }
                else if (remain)
                {
                    int tmp = b[i].first - pre;
                    int u = min(1ll * tmp, remain);
                    ans += u, remain -= u, pre += u;
                    if (pre == b[i].first)
                        break;
                }
                else
                    break;
            }
            if (pre < b[i].first)
                break;
            a[b[i].second] = c[b[i].second];
            int id=b[i].se;
            if(!in[id])
            {
                in[id]=1;
                if(li[id].size())
                p.push(li[id].front()),li[id].pop();
            }
        }
        ans += remain;
        for (int i = 0; i < n; i++)
            ans += a[i];
        cout << ans << '\n';

        for(int i=0;i<max(n,m);i++)
        in[i]=0;
        for(int i=0;i<max(n,m);i++)
        while(li[i].size())li[i].pop();
    }
    return 0;
}