#include <bits/stdc++.h>
using namespace std;
using ll=long long;

void solve() {
    int n,m; cin>>n>>m;
    vector<ll> v(n+1);
    for(int i=1; i<=n; i++) cin>>v[i];

    ll maxx=0,sum=0;
    for(int i=1; i<=m; i++) {
        ll a,b; cin>>a>>b;
        maxx=max(maxx,a);
        sum+=1ll*b;
    }

    ll minn=1e9+1; int idx=0;
    for(int i=1; i<=maxx; i++)
        if(v[i]<minn) {
            minn=v[i];
            idx=i;
        }

    v[idx]-=1ll*sum;

    sort(v.begin()+1,v.end());

    ll ans=0;
    for(int i=1; i<=n; i++) {
        ans+=1ll*v[i];
        cout<<ans<<" ";
    }
    cout<<endl;

}
int main() {
    ios::sync_with_stdio(false),cin.tie(nullptr);
    int t; cin>>t;
    while(t--)
        solve();

}

/*
2
5 2
1 2 3 4 5
3 1
4 2
7 3
4 3 1 10 3 8 6
4 9
3 8
4 5
 */