#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+10,inf=1e18;
//struct Tree{int l,r,mn,add,pos;}tree[N<<2];
int t,n,m,lstans,a[N],mnpos[N];//set<pair<int,int> >s;
inline int read(){
    int r=0,f=1;char c=getchar();
    while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
    while(isdigit(c))r=(r<<1)+(r<<3)+(c^48),c=getchar();
    return r*f;
}
void put(int x){
    if(x<0){putchar('-');x=~x+1;}
    if(x>9)put(x/10);
    putchar(x%10+'0');
}
/*
void spread(int p){
    if(!tree[p].add)return;
    tree[p<<1].add+=tree[p].add;
    tree[p<<1|1].add+=tree[p].add;
    tree[p<<1].mn+=tree[p].add;
    tree[p<<1|1].mn+=tree[p].add;
    tree[p].add=0;
}
void build(int p,int l,int r){
    tree[p].l=l,tree[p].r=r,tree[p].add=0;
    if(l==r){tree[p].mn=a[l],tree[p].pos=l;return;}
    int mid=(l+r)>>1;build(p<<1,l,mid),build(p<<1|1,mid+1,r);
    if(tree[p<<1].mn<=tree[p<<1|1].mn)
        tree[p].mn=tree[p<<1].mn,tree[p].pos=tree[p<<1].pos;
    else tree[p].mn=tree[p<<1|1].mn,tree[p].pos=tree[p<<1|1].pos;
}
void change(int p,int l,int r,int x){
    if(l<=tree[p].l&&tree[p].r<=r){
        tree[p].mn+=x,tree[p].add+=x;return;
    }spread(p);
    int mid=(tree[p].l+tree[p].r)>>1;
    if(l<=mid)change(p<<1,l,r,x);
    if(r>mid)change(p<<1|1,l,r,x);
    if(tree[p<<1].mn<=tree[p<<1|1].mn)
        tree[p].mn=tree[p<<1].mn,tree[p].pos=tree[p<<1].pos;
    else tree[p].mn=tree[p<<1|1].mn,tree[p].pos=tree[p<<1|1].pos;
}
void update(int p,int x,int v){
    if(tree[p].l==tree[p].r){tree[p].mn=v;return;}
    spread(p);
    int mid=(tree[p].l+tree[p].r)>>1;
    if(x<=mid)update(p<<1,x,v);
    else update(p<<1|1,x,v);
    if(tree[p<<1].mn<=tree[p<<1|1].mn)
        tree[p].mn=tree[p<<1].mn,tree[p].pos=tree[p<<1].pos;
    else tree[p].mn=tree[p<<1|1].mn,tree[p].pos=tree[p<<1|1].pos;
}*/
signed main(){
//    freopen("cpp.in","r",stdin);
  //  freopen("cpp.out","w",stdout);
    t=read();
    while(t--){
        n=read(),m=read(),lstans=0;
        for(int i=1,mn=inf;i<=n;i++){
            a[i]=read(),mnpos[i]=mnpos[i-1];
            if(a[i]<mn)mn=a[i],mnpos[i]=i;
        }
        for(int i=1;i<=m;i++){
            int rr=read(),w=read();
//            change(1,1,rr,-w);
//            s.insert(make_pair(rr,w));
            a[mnpos[rr]]-=w;
        }
        sort(a+1,a+1+n);
        for(int T=1;T<=n;T++){
            lstans+=a[T],put(lstans),printf(" ");/*int nw=tree[1].pos;
            auto it=lower_bound(s.begin(),s.end(),make_pair(nw,0ll)),it1=it;
            for(;it!=s.end();)change(1,1,it->first,it->second),it1=it++,s.erase(it1);
            update(1,nw,inf);*/
        }puts("");
    }
    return 0;
}