#include<bits/stdc++.h>
using namespace std;
#define N 100005
#define fr first
#define se second
#define ls u<<1
#define rs u<<1|1
#define M 10000005
#define p 998244353
#define pb push_back
#define ll long long
#define inf 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
struct node{ll val,cut;};
int n,m;
node a[N];
ll prmx[N],sfmn[N];
void sol(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%lld",&a[i].val),a[i].cut=0;
	for(int i=1,x,y;i<=m;i++)scanf("%d%d",&x,&y),a[x].cut+=y;
	for(int i=n;i;i--)a[i].cut+=a[i+1].cut;
	sort(a+1,a+1+n,[](const node &x,const node &y){return x.val<y.val;});
	for(int i=1;i<=n;i++)prmx[i]=max(prmx[i-1],a[i].cut);
	sfmn[n+1]=inf;for(int i=n;i;i--)sfmn[i]=min(sfmn[i+1],a[i].val-a[i].cut);
	ll prsum=0;
	for(int k=1;k<=n;k++){
		printf("%lld ",min(prsum+sfmn[k],prsum+a[k].val-prmx[k]));
		prsum+=a[k].val;
	}puts("");
}
int main(){
	int t;scanf("%d",&t);while(t--)
	sol();
}