#include<bits/stdc++.h>
using namespace std;
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n,m;
		cin>>n>>m;
		vector<vector<int>> G(n+5);
		vector<int> b(n+5);
		vector<pair<int,int>> srt;
		for(int i=1;i<=n;i++)
		{
			cin>>b[i];
			srt.emplace_back(b[i],i);
		}
		sort(srt.begin(),srt.end(),greater<pair<int,int>>());
		for(int i=1;i<=m;i++)
		{
			int u,v;
			cin>>u>>v;
			G[u].push_back(v);
			G[v].push_back(u);
		}
		vector<int> pa(n+5),vis(n+5);
		function<int(int)> find=[&](int x){return pa[x]?pa[x]=find(pa[x]):x;};
		int cnt=0;
		int pre=1e9;
		long long ans=0;
		for(auto [w,u]:srt)
		{
			ans+=1ll*(pre-w)*cnt;
			vis[u]=1;
//			cerr<<"now "<<u<<' '<<w<<' '<<pre-w<<' '<<cnt<<endl;
			cnt++;
			for(auto v:G[u])
			{
				if(not vis[v])continue;
				int pu=find(u),pv=find(v);
				if(pu!=pv)
				{
//					cerr<<"merge "<<pu<<' '<<pv<<endl;
					pa[pv]=pu,cnt--;
				}
			}
			pre=w;
		}
		ans+=1ll*pre*cnt;
		cout<<ans<<endl;
	}
	
	return 0;
}