#include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define lowbit(x) x & (-x)
typedef pair<int, int> pii;
#define LF(x) fixed << setprecision(x)
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
int n, m;
int a[N], day[N];
void solve()
{
    int s1 = 0, s2 = 0;
    cin >> n >> m;
    vector<int> ans(n + 1, 0);
    for (int i = 1; i <= n; i++)
        day[i] = 0;
    for (int i = 1; i <= n; i++)
        cin >> a[i], s1 += a[i];
    for (int i = 1; i <= m; i++)
    {
        int r, w;
        cin >> r >> w;
        day[r] += w;
        s2 += w;
    }

    multiset<int> st;
    for (int i = 2; i <= n; i++)
        st.insert(-a[i]);
    st.insert(-a[1] + day[1]);
    int nowmn = 1, nowval = -a[1] + day[1];
    ans[n] = s1 - s2;

    for (int i = n - 1; i >= 1; i--)
    {
        auto it = st.begin();
        ans[i] = ans[i + 1] + *it;
        if (*it == nowval)
        {
            st.erase(st.find(*it));
            nowmn++;
            st.erase(st.find(-a[nowmn]));
            st.insert(day[nowmn] - a[nowmn]);
            nowval = day[nowmn] - a[nowmn];
        }
        else
            st.erase(st.find(*it));
    }
    for (int i = 1; i <= n; i++)
        cout << ans[i] << " ";
    cout << endl;
}
signed main()
{
    Yshanqian;
    int T;
    T = 1;
    cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}