#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) (x & (-x))
#define lc p << 1
#define rc p << 1 | 1
typedef long long ll;
typedef pair<int,int> pii;
mt19937 rnd(time(0));
const int N = 3e5 + 7;
const int mod = 1e9 + 7;
int tree[N],a[N];
pii c[N];
void solve() {
    int now = 0;
	int n , m; cin >> n >> m;
    for(int i = 1;i <= n;i++) cin >> a[i],now += a[i];
    for(int i = 1;i <= m;i++) cin >> c[i].first >> c[i].second;
    sort(c + 1,c + m + 1);
    int ans = 0;
    for(int i = 1;i <= m;i++) {
        if(now < c[i].second - c[i].first) {
            cout << ans + now << "\n";
            return ;
        }
        ans += c[i].first - c[i - 1].first;
        now -= c[i].first - c[i - 1].first;
        now += min(c[i].first - c[i - 1].first,a[c[i].second]); 
    }
    cout << ans + now << "\n";
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}