#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
using LL = long long;
using PII = pair<int, int>;

void solve() {
    int n, m;
    cin >> n >> m;

    vector<LL> a(n + 1);
    for (int i = 1; i <= n; i++)
        cin >> a[i];

    vector<PII> arr;
    for (int i = 0; i < m; i++) {
        LL r, w;
        cin >> r >> w;
        arr.push_back({r, w});
    }

    int cur = 0;
    sort(arr.begin(), arr.end());
    LL tmin = 2e9 + 10, tpos = 0;

    for (int i = 1; i <= n; i++) {
        if (a[i] < tmin) {
            tmin = a[i];
            tpos = i;
        }
        while(i == arr[cur].first) {
            a[tpos] -= arr[cur].second;
            cur++;
            if (a[tpos] < tmin) {
                tmin = a[tpos];
                tpos = tpos;
            }
        }
    }

    sort(a.begin() + 1, a.begin() + 1 + n);

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

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int t;
    cin >> t;
    while(t--)
        solve();
    return 0;
}