#include <map>
#include <set>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define pb emplace_back
#define pp pop_back()
#define int long long
#define laile cout<<"laile"<<endl
#define lowbit(x) ((x)&(-x))
#define double long double
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld %lld",&x,&y)
#define sd(x) scanf("%Lf",&x)
#define sdd(x,y) scanf("%Lf %Lf",&x,&y)
#define _for(i,n) for(int i=0;i<(n);++i)
#define _rep(i,a,b) for(int i=(a);i<=(b);++i)
#define _pre(i,a,b) for(int i=(a);i>=(b);--i)
#define all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef unsigned long long ULL;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
const int N=1e6+10,INF=4e18;
int n,m;
int cunmiidx[N];
int q[N];
void solve()
{
	int mi=INF,miidx=-1;
	cin>>n>>m;
	_rep(i,1,n)
	{
		cin>>q[i];
		if(q[i]<mi)mi=q[i],miidx=i;
		cunmiidx[i]=miidx;//前i个数的最小值下标
	}
	_rep(i,1,m)
	{
		int a,b;
		cin>>a>>b;
		q[cunmiidx[a]]-=b;
	}
	sort(q+1,q+1+n);
	int sum=0;
	_rep(i,1,n)
	{
		sum+=q[i];
		cout<<sum<<' ';
	}
	cout<<'\n';
	return ;
}
signed main()
{
	IOS;
	int T=1;
    cin>>T;
	while(T--)
		solve();
	return 0;
}