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

#define qmx(a,b) a<b?b:a
#define qmn(a,b) a>b?b:a
#define ll long long
#define fr first
#define se second

const int mxn = 2e5+5;

priority_queue < pair<ll, int>, vector< pair<ll, int> >, greater< pair<ll, int>> >que;

priority_queue < ll, vector<ll>, greater<ll> > fq;

struct token{
    int ri;
    ll wi;
}wr[mxn];

ll a[mxn], mna[mxn], sufw[mxn], ans;

bool used[mxn];

inline bool cmp(struct token t1, struct token t2){
    return t1.ri < t2.ri;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int test, di;
    cin>>test;
    while(test--){
        int n, m;
        cin >> n >> m;
        mna[0] = 1;
        for(int i = 1 ; i <= n ; i++){
            cin >> a[i];
            used[i] = false;
            if(a[i] < a[mna[i - 1]])
                mna[i] = i;
            else
                mna[i] = mna[i - 1];
        }
        for(int i = 1 ; i <= m ; i++){
            cin >> wr[i].ri >> wr[i].wi;
        }
        sort(wr + 1, wr + 1 + m, cmp);
        for(int i = 1 ; i <= m ; i++){
            a[mna[wr[i].ri]] -= wr[i].wi; 
        }
        for(int i = 1 ; i <= n ; i++){
            fq.push(a[i]);
        }
        ans = 0;
        for(int i = 1 ; i <= n ; i++){
            ans += fq.top();
            cout << ans << " ";
            fq.pop();
        }
        cout << endl;
    }
    return 0;
}