#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>

using namespace std;

#define SC(a, b) (static_cast<a>(b))

typedef long long ll;

struct fk {
    int r;
    ll w;
};

bool operator<(const fk &a, const fk &b)
{
    return a.r < b.r;
}

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

    vector<ll> a(n), a2(n);
    vector<fk> b(m);
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    a2 = a;
    for (int i = 0; i < m; ++i)
        cin >> b[i].r >> b[i].w, --b[i].r;
    sort(b.begin(), b.end());
    int p = -1, pos = -1;
    for (int i = 0; i < m; ++i) {
        while (p < b[i].r) {
            ++p;
            if (pos == -1 || a[pos] > a[p])
                pos = p;
        }
        a2[pos] -= b[i].w;
    }
    sort(a2.begin(), a2.end());
    ll s = 0;
    for (int i = 0; i < n; ++i) {
        s += a2[i];
        cout << s << " \n"[i == n - 1];
    }

    return;
}

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

    int T;
    cin >> T;
    while (T--) {
        slv();
    }
    return 0;
}