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

using ll = long long;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;

#define lc k << 1
#define rc k << 1 | 1

struct SegmentTree {
    int l, r, idx;
    ll mn, lazy;
};

SegmentTree tree[N * 4];
int a[N], r[N], w[N];

void pushup(int k) {
    if (tree[lc].mn < tree[rc].mn) {
        tree[k].mn = tree[lc].mn;
        tree[k].idx = tree[lc].idx;
    }
    else {
        tree[k].mn = tree[rc].mn;
        tree[k].idx = tree[rc].idx;
    }
}

void pushdown(int k, ll lazy) {
    if (lazy == 0)
        return;
    
    int l = tree[k].l;
    int r = tree[k].r;
    int mid = (l + r) / 2;
    tree[lc].lazy += lazy;
    tree[rc].lazy += lazy;
    tree[lc].mn += lazy;
    tree[rc].mn += lazy;
    tree[k].lazy = 0;
}

void build(int k, int l, int r) {
    tree[k].l = l;
    tree[k].r = r;
    if (l == r) {
        tree[k].mn = a[l];
        tree[k].idx = l;
        return;
    }

    int mid = (l + r) / 2;
    build(lc, l, mid);
    build(rc, mid + 1, r);
    pushup(k);
}

void update(int k, int l, int r, int w) {
    if (tree[k].l > r || tree[k].r < l)
        return;
    if (tree[k].l >= l && tree[k].r <= r) {
        tree[k].mn += w;
        tree[k].lazy += w;

        return;
    }

    pushdown(k, tree[k].lazy);
    update(lc, l, r, w);
    update(rc, l, r, w);
    pushup(k);
}

pair<int, int> query(int k, int l, int r) {
    if (tree[k].l > r || tree[k].r < l)
        return {INF, 0};
    if (tree[k].l >= l && tree[k].r <= r) 
        return {tree[k].mn, tree[k].idx};
    
    pushdown(k, tree[k].lazy);
    auto p = query(lc, l, r);
    auto q = query(rc, l, r);
    if (p.first < q.first) 
        return p;
    else 
        return q;
}

pair<int, int> tmp[N];

void solve() {
    memset(tree, 0, sizeof tree);

    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= m; i++) {
        cin >> r[i] >> w[i];
        tmp[i] = {r[i], w[i]};
    }
    
    sort(tmp + 1, tmp + m + 1);

    build(1, 1, n);
    for (int i = 1; i <= m; i++) {
        update(1, 1, r[i], -w[i]);
    }

    int ans = 0;
    for (int i = 1, cur = m; i <= n; i++) {
        auto [mn, idx] = query(1, 1, n);
        update(1, idx, idx, INF);
        for (int j = cur; tmp[j].first >= idx; j--) {
            update(1, 1, tmp[j].first, tmp[j].second);
        }
        cur = min(cur, idx - 1);
        ans += mn;
        cout << ans << " ";
    }
    cout << endl;
}

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

    int T = 1;
    cin >> T;

    while (T--) {
        solve();
    }

    return 0;
}