#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) (x & (-x))
typedef long long ll;
typedef pair<int,int> pii;
mt19937 rnd(time(0));
const int N = 2e5 + 7;
const int mod = 1e9 + 9;
int a[N];
pii b[N];
void solve() {
    int n , m; cin >> n >> m;
    for(int i = 1;i <= n;i++) cin >> a[i];
    for(int i = 1;i <= m;i++) cin >> b[i].first >> b[i].second;
    sort(b + 1,b + m + 1);
    int mi = 1e16,mid,cnt = 1;
    for(int i = 1;i <= n;i++) {
        if(cnt > m) break;
        if(a[i] < mi) mi = a[i],mid = i;
        while(i == b[cnt].first && cnt <= m) a[mid] -= b[cnt++].second;
    }
    sort(a + 1,a + n + 1);
    int sum = 0;
    for(int i = 1;i <= n;i++) {
        sum += a[i];
        cout << sum << " ";
    }
    cout << "\n";
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}