//#pragma GCC optimize(1)
//#pragma GCC optimize(2)
//#pragma GCC optimize(3, "Ofast", "inline")

#include <bits/stdc++.h>

#define int long long
#define ld long double
#define i32 int
#define u32 unsigned int
#define i64 long long
#define u64 unsigned long long
#define u27 __int128
#define endl '\n'
#define VI vector<int>
#define VVI vector<VI>
#define rand() RANDOM(GEN)
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define CTM (cout<<"Time:"<<static_cast<double>(clock()-START_TIME)/CLOCKS_PER_SEC*1000<<"ms"<<endl)
typedef long long ll;

using namespace std;
random_device SEED;
mt19937_64 GEN(SEED());
uniform_int_distribution<u64> RANDOM(0, numeric_limits<u64>::max());
const clock_t START_TIME = clock();
const int N=1e5+50;
array<int,2> sz[N];
int dp[N],now[N],vis[N],drl[N];
signed main() {
#ifndef ONLINE_JUDGE
    freopen(".in", "r", stdin);
    freopen(".out", "w", stdout);
#endif
    IO;
    int tt;
    cin>>tt;
    while(tt--) {
        int res=0,ans=0;
        priority_queue<array<int,2>,vector<array<int,2>>,greater<>> st;
        int n,m;
        cin>>n>>m;
        vector<vector<int>> G(n+1);
        for (int i = 1; i <= n; ++i) {
            cin>>dp[i];
            drl[i]=dp[i];
            vis[i]=now[i]=0;
        }
        for (int i = 1; i <= m; ++i) {
            int a,b;
            cin>>a>>b;
            sz[i]={a,b};
            G[b].push_back(a);
            if(!vis[b]) {
                vis[b]=1;
                st.push({a,b});
            }
        }
        for (int i = 1; i <= n; ++i) {
            if(!vis[i]) res+=dp[i];
        }
        for (int i = 1; i <= m; ++i) {
            auto [dis,tar]=sz[i];
            dis-=ans;
            while(dis and !st.empty()) {
                auto [jl,bh]=st.top();
                if(dis>=dp[bh]) {
                    ans+=dp[bh],dis-=dp[bh];
                    dp[bh]=0;
                    st.pop();
                } else {
                    dp[bh]-=dis;
                    ans+=dis,dis=0;
                }
            }
            if(dis) {
                if(res>=dis) res-=dis,ans+=dis,dis=0;
                else break;
            }
            now[tar]++;
            if(now[tar]==G[tar].size()) res+=drl[tar];
            else st.push({G[tar][now[tar]],tar});
            dp[tar]=drl[tar];
        }
        cout<<ans+res<<endl;
    }
    return 0;
}