#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];

    vector<int> sub(n+1);
    fill(sub.begin(),sub.end(),0);

    for(int i=0; i<m; i++) {
        int a,b; cin>>a>>b;
        sub[a]+=b;
    }

    for(int i=1,minn=1; i<=n; i++) {
        if(v[minn]>v[i]) minn=i;
        v[minn]-=sub[i];
    }
    sort(v.begin()+1,v.end());
    v[0]=0;
    for(int i=1; i<=n; i++) {
        v[i]+=v[i-1];
        cout<<v[i]<<" ";
    }
    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
 */