#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e6;

signed main()
{
    IOS;
    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        vector<int> v(n + 1);
        vector<pii> c(m + 1);
        int now = 0;
        for (int i = 1; i <= n; i++)
        {
            cin >> v[i];
            now += v[i];
        }
        for (int i = 1; i <= m; i++)
        {
            auto &[fi, se] = c[i];
            cin >> fi >> se;
        }
        sort(c.begin(),c.end());
        int ans = now;
        int f = 0;
        for (int i = 1; i <= m; i++)
        {
            auto [nfi, nse] = c[i];
            auto [qfi, qse] = c[i - 1];

            if (now >= nfi - qfi)
            {
                if (nfi - f >= v[nse])
                {
                    f += v[nse];
                    ans += v[nse];
                    now -= nfi - qfi - v[nse];
                }
                else
                {
                    int _=nfi - f;
                    f += _;
                    ans += _;
                    now -= nfi - qfi - _;
                }
            }
            else
                break;
        }
        cout<<ans<<endl;
    }
}