#include <cstdio>
#include <algorithm>
#pragma GCC optimize(2)
using namespace std ;
int n , m ;
struct node
{
	int bh , br ;
} a[100010] ;
int bb[100010] ;
int fir[100010] , nxt[400010] , zx[400010] , bs ;
int fa[100010] ;
int lt = 0 ;
inline bool pd( node a , node b )
{
	return a.br > b.br ;
}
int cx( int a )
{
	if( fa[a] != a ) fa[a] = cx( fa[a] );
	return fa[a];
}
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while( ch < '0' || ch > '9' ){if(ch == '-') f = -1; ch = getchar(); }
	while( ch >= '0' && ch <= '9'){x = (x<<3) + (x<<1) + ch-'0'; ch = getchar(); }
	return x*f;
}
int main ()
{
	int t ;
	int t1 , t2 ;
	t =read();
	while( t -- )
	{
		bs = 0 ; lt = 0 ;
		n = read(); m = read();
		for( int i = 0 ; i < n ; i ++ )
		{
			a[i].br = read();
			bb[i] = a[i].br ;
			a[i].bh = i ;
			fa[i] = i;
			fir[i] = -1;
		}
		for( int i = 0 ; i < m ; i ++ )
		{
			t1 = read(); t2 = read();
			t1 -- ;
			t2 -- ;
			if( a[t1].br <= a[t2].br )
			{
				nxt[bs] = fir[t1] ;
				fir[t1] = bs ;
				zx[bs] = t2 ;
				bs ++ ;
			}
			if( a[t2].br <= a[t1].br )
			{
				nxt[bs] = fir[t2] ;
				fir[t2] = bs ;
				zx[bs] = t1 ;
				bs ++ ;
			}
		}
		sort( a , a + n , pd ) ;
		long long ans = 0 ;
		for( int i = 0 ; i < n ; i ++ )
		{
			lt ++ ;
			for( int j = fir[a[i].bh] ; j != -1 ; j = nxt[j] )
			{
				if( bb[zx[j]] < a[i].br ) continue ;
				int f1 = cx(a[i].bh), f2 = cx(zx[j]);
				if( f1 != f2 )
				{
					fa[f1] = f2 ;
					lt -- ;
				}
			}
			while( i < n - 1 && a[i + 1].br == a[i].br )
			{
				i ++ ;
				lt ++ ;
				for( int j = fir[a[i].bh] ; j != -1 ; j = nxt[j] )
				{
					if( bb[zx[j]] < a[i].br ) continue ;
					int f1 = cx(a[i].bh) , f2 = cx(zx[j]);
					if( f1 != f2 )
					{
						fa[f1] = f2 ;
						lt -- ;
					}
				}
			}
			if( i != n - 1 )
			{
				ans += (long long)lt * ( a[i].br - a[i + 1].br ) ;
			}
			else
			{
				ans += (long long)lt * a[i].br ;
			}
		}
		printf( "%lld\n" , ans ) ;
	}
	return 0 ;
}