# include <bits/stdc++.h>

using namespace std ;

int n , m ;
int a[200005] ;
vector < int > g[200005] ;
typedef long long ll ;
priority_queue < pair< ll , int > , vector < pair< ll , int > > , greater < pair< ll , int > > > q ;

void solve()
{
	scanf("%d%d" , &n , &m) ;
	for ( int i = 1 ; i <= n ; i++ ) scanf("%d" , a + i) , g[i].clear() ;
	for ( int i = 1 ; i <= m ; i++ )
	{
		int x , y ;
		scanf("%d%d" , &x , &y) ;
		g[x].push_back( y ) ;
	}
	while ( q.size() ) q.pop() ;
	for ( int i = 1 ; i <= n ; i++ )
	{
		q.push( { a[i] , i } ) ;
		for ( auto y : g[i] ) 
		{
			auto t = q.top() ;
			q.pop() ;
			a[t.second] -= y ;
			q.push( { a[t.second] , t.second } ) ;
		}
	}
	ll sum = 0 ;
	for ( int i = 1 ; i <= n ; i++ )
	{
		sum += q.top().first ;
		q.pop() ;
		printf("%lld\n" , sum) ;
	}
}

int main()
{
	int t ;
	scanf("%d" , &t) ;
	while ( t -- ) solve() ;
	return 0 ;
}