#include <bits/stdc++.h>

using namespace std;

using LL = long long;

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

    vector<LL> a(n + 1), pre(n + 1);
    vector<LL> idx(n + 1);

    for(int i = 1;i <= n; i ++)
    {
        cin >> a[i];
        if(i > 1 && a[i] < pre[i - 1])
        {
            pre[i] = a[i];
            idx[i] = i;
        }
        else if(i > 1)  
        {
            pre[i] = pre[i - 1];
            idx[i] = idx[i - 1];
        }
        else if(i == 1)
        {
            pre[i] = a[i];
            idx[i] = 1;
        }
    }

    while(m --)
    {
        int r, w;
        cin >> r >> w;

        //clog << idx[r] << '\n';

        a[idx[r]] -= w;
    }

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

    LL ans = 0;

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

}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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