#include <stdio.h>
#include <algorithm>
#include <vector>

using namespace std;

struct node {
	int i , x;
} s[120000];
int n , m;
vector < int > g[120000];
int c[120000];
int vis[120000];
long long ans;
void clear () {
	int i;
	for ( i = 1 ; i <= n ; i++ ) {
		g[i].clear ();
		vis[i] = c[i] = 0;
	}
	ans = 0;
}
bool cmp ( node x1 , node x2 ) {
	return x1.x > x2.x;
}
int find ( int x ) {
	int i , t;
	for ( i = x ; c[i] > 0 ; i = c[i] ) ;
	while ( c[x] > 0 ) {
		t = c[x];
		c[x] = i;
		x = t;
	}
	return i;
}
void Union ( int x , int y ) {
	c[y] = x;
}
void work () {
	int i , u , v;
	scanf ( "%d%d" , &n , &m );
	for ( i = 1 ; i <= n ; i++ ) {
		scanf ( "%d" , &s[i].x );
		s[i].i = i;
	}
	for ( i = 1 ; i <= m ; i++ ) {
		scanf ( "%d%d" , &u , &v );
		g[u].push_back ( v );
		g[v].push_back ( u );
	}
	sort ( s + 1 , s + 1 + n , cmp );
	ans = 0;
	for ( i = 1 ; i <= n ; i++ ) {
		c[i] = -1;
	}
	for ( i = 1 ; i <= n ; i++ ) {
		ans += s[i].x;
		vis[s[i].i] = 1;
		for ( auto j : g[s[i].i] ) {
			if ( vis[j] == 0 ) continue;
			if ( find ( j ) == find ( s[i].i ) ) {
				continue;
			}
			ans -= s[i].x;
			Union ( find ( s[i].i ) , find ( j ) );
		}
	}
	printf ( "%lld\n" , ans );
}
int main () {
	int t;
	scanf ( "%d" , &t );
	while ( t-- ) {
		work ();
		clear ();
	}
	return 0;
}