#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
typedef long long ll;
typedef long double ld;
#define debug(a) cout<<a<<'\n'
#define Pll pair<ll,ll>
#define PII pair<int,int>
#define ft first
#define sd second
#define vec vector
#define pushk push_back
#define pl p<<1
#define pr p<<1|1
using namespace std;
const int N = 2e5 + 10, M = 1e4 + 10, mod = 1e9 + 7;
const ll inf = 1e18;
const ld eps = 1e-13;
int mov[4][2] = { {0,1},{1,0},{-1,0},{0,-1} }, dx, dy, _ = 1, __ = 1;
void bout(bool f) {
	if (f)cout << "Yes\n";
	else cout << "No\n";
}
ll n, m, k;
ll a[N],c[N],ans[N];
Pll sum[N];

void ini() {
	
}
void solve() {
	cin>>n>>m;
	for(int i=1;i<=n;++i){
		cin>>a[i];
		sum[i].ft=a[i];
		sum[i].sd=i;
	}
	sort(sum+1,sum+n+1);
	for(int i=1;i<=n;++i){
		sum[i].ft+=sum[i-1].ft;
	}
	int x,y;
	memset(c,0,8*(m+3));
	for(int i=1;i<=m;++i){
		cin>>x>>y;
		c[x]-=y;
	}
	x=y=0;
	priority_queue<Pll,vec<Pll>,greater<Pll>>q;
	for(int i=n;i>=1;--i){
		x+=c[i];
		c[i]=x+a[i];
		q.push({c[i],i});
	}
	ll l=n+1;
	for(int i=1;i<=n;++i){
		x=min(l,sum[i].sd);
		ans[i]=sum[i].ft-a[x]+c[x];
		while(!q.empty()){
			if(q.top().sd>=l)q.pop();
			else break;
		}
		if(!q.empty()){
			ans[i]=min(ans[i],sum[i-1].ft+q.top().ft);
		}
		l=x;
	}
	for(int i=1;i<=n;++i)cout<<ans[i]<<' ';
	cout<<'\n';
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#ifndef ONLINE_JUDGE
	streambuf* cinbackup = cin.rdbuf(), * coutbackup = cout.rdbuf();
	ifstream fin("in.txt");
	ofstream fout("out.txt");
	cin.rdbuf(fin.rdbuf());
	cout.rdbuf(fout.rdbuf());
#endif
	cin >> _;
	__ = _;
	ini();
	while (_--) {
		solve();
	}
	return 0;
}