#pragma GCC optimize(3,"Ofast","inline")
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int	main(){
    ios::sync_with_stdio(0); cin.tie(0);
	int T=1;
	cin>>T;
	while(T--)
    {
        ll n,m;
        cin>>n>>m;
        vector<ll>a(n+5);
        ll sum=0;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            sum+=a[i];
        }
        vector<ll>r(m+5),w(m+5);
        vector<ll>pre(n+5),ans(n+5),vis(n+5,1);
        for(int i=1;i<=m;i++){
            cin>>r[i]>>w[i];
            pre[r[i]]+=w[i];
            sum-=w[i];
        }
        //cout<<sum<<"\n";
        for(int i=1;i<=n;i++){
            pre[i]+=pre[i-1];
        }

        priority_queue<pll>q;
        for(int i=1;i<=n;i++){
            q.push({a[i],i});
        }

        ans[n]=sum;
        ll mex=1;
        for(int i=n-1;i>=1;i--){
            while(vis[mex]==0){
                mex++;
            }
            auto [x,id1]=q.top();q.pop();
            //if(i==2){ cout<<mex<<" "<<x<<" "<<id1<<"\n"; }
            if(id1==mex){
                auto [y,id2]=q.top();q.pop();
                if(x-pre[id1]>=y){
                    ans[i]=sum-(x-pre[id1]);
                    sum-=x;
                    q.push({y,id2});
                    vis[id1]=0;
                }
                else{
                    sum-=y;
                    ans[i]=sum;
                    q.push({x,id1});
                    vis[id2]=0;
                }
            }
            else{
                sum-=x;
                ans[i]=sum;
                vis[id1]=0;
            }
        }

        for(int i=1;i<=n;i++){
            cout<<ans[i]<<" ";
        }
        cout<<"\n";
    }
}
/*
2
 5 2
 1 2 3 4 5
 3 1
 4 2
 7 3
 4 3 1 10 3 8 6
 4 9
 3 8
 4 5

1
5 2
3 5 2 1 1
2 2
3 1

1
6 3
9 14 12 1 5 4
4 3
2 5
1 9


*/