#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 2e5 + 10;

inline int lowbit (int x) {
  return x & -x;
}

struct coupon {
  int x, y;
  bool operator < (const coupon &i) const {
    return x < i.x;
  }
} c[N];

int T, n, m, a[N], tr[N];
ll ans, co[N], cst[N];
bool f[N];

void modify (int x) {
  if (x > n) {
    return ;
  }
  tr[x]++, modify(x + lowbit(x));
}

int Query (int x) {
  if (!x) {
    return 0;
  }
  return tr[x] + Query(x - lowbit(x));
}

void Solve () {
  set<pair<ll, int>> st;
  ans = 0;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i], ans += a[i], cst[i] = -a[i], st.insert({cst[i], i}), tr[i] = f[i] = 0;
  }
  for (int i = 1; i <= m; i++) {
    cin >> c[i].x >> c[i].y, ans -= c[i].y;
  }
  sort(c + 1, c + m + 1);
  if (c[1].x == 1) {
    st.erase({cst[1], 1}), cst[1] += c[1].y, st.insert({cst[1], 1});
  }
  for (int i = n, j = 1, k = 1; i; i--) {
    co[i] = ans;
    auto del = *st.begin();
    f[del.second] = 1, ans += del.first, modify(del.second);
    bool ch = 0;
    while (k <= m && c[k].x == Query(c[k].x)) {
      k++, ch = 1;
    }
    while (j <= n && f[j]) {
      j++;
    }
    st.erase(st.begin());
    if (ch && c[k].x == Query(c[k].x) + 1) {
      st.erase({cst[j], j}), cst[j] += c[k].y, st.insert({cst[j], j});
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << co[i] << ' ';
  }
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  for (cin >> T; T--; Solve(), cout << '\n') {}
  return 0;
}