#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LLONG_MAX / 4;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define all(a) begin(a), end(a)
template<class T> bool chmin(T& a, T b) { if(a <= b) return 0; a = b; return 1; }
template<class T> bool chmax(T& a, T b) { if(a >= b) return 0; a = b; return 1; }

ll N, M;
vector<ll> A;
vector<ll> B;
void solve() {
    cin >> N >> M;
    A.resize(N);
    B.assign(N, 0);
    for(ll& a : A) cin >> a;
    while(M--) {
        ll r, w;
        cin >> r >> w;
        B[--r] += w;
    }
    for(ll i = N; --i; ) B[i - 1] += B[i];
    vector<ll> ans(N, INF);
    vector<ll> I(N), J(N);
    rep(i, 0, N) I[i] = J[i] = i;
    ranges::sort(I, less<>{}, [&](ll i) { return A[i]; });
    ranges::sort(J, less<>{}, [&](ll i) { return A[i] - B[i]; });

    {
        ll cost = 0, mn = N - 1;
        rep(n, 0, N) {
            const ll i = I[n];
            cost += A[i];
            chmin(mn, i);
            chmin(ans[n], cost - B[mn]);
        }
    }
    {
        vector<bool> used(N);
        ll cost = 0, m = 0;
        rep(n, 0, N) {
            while(used[J[m]]) m++;
            const ll j = J[m];
            chmin(ans[n], cost + A[j] - B[j]);
            const ll i = I[n];
            cost += A[i];
            used[i] = 1;
        }
    }
    rep(i, 0, N) cout << ans[i] << " \n"[i + 1 == N];
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T;
    cin >> T;
    while(T--) solve();
}