"""要素の併合・連結判定・成分サイズを扱う基本Union-Find。"""

class UnionFind:
    __slots__ = ("n", "parent", "component_count")

    def __init__(self, size):
        self.n = size
        self.parent = [-1] * size
        self.component_count = size

    def find(self, node):
        parent = self.parent
        root = node
        while parent[root] >= 0:
            root = parent[root]
        while node != root:
            next_node = parent[node]
            parent[node] = root
            node = next_node
        return root

    leader = find
    root = find

    def merge(self, first, second):
        first = self.find(first)
        second = self.find(second)
        if first == second:
            return first
        parent = self.parent
        if parent[first] > parent[second]:
            first, second = second, first
        parent[first] += parent[second]
        parent[second] = first
        self.component_count -= 1
        return first

    unite = merge
    union = merge

    def same(self, first, second):
        return self.find(first) == self.find(second)

    def size(self, node):
        return -self.parent[self.find(node)]

    def groups(self):
        result = [[] for _ in range(self.n)]
        for node in range(self.n):
            result[self.find(node)].append(node)
        return [group for group in result if group]

    def __str__(self):
        return str(self.groups())

    def __repr__(self):
        return "UnionFind(%r)" % self.groups()

"""隣接要素の連結区間と区間併合を管理するUnion-Find。"""



class ContiguousUnionFind(UnionFind):
    __slots__ = ("left", "right")

    def __init__(self, size):
        super().__init__(size)
        self.left = list(range(size))
        self.right = [index + 1 for index in range(size)]

    def merge(self, first, second):
        first = self.find(first)
        second = self.find(second)
        if first == second:
            return first
        left = min(self.left[first], self.left[second])
        right = max(self.right[first], self.right[second])
        root = super().merge(first, second)
        self.left[root] = left
        self.right[root] = right
        return root

    unite = merge

    def range_merge(self, left, right):
        left = max(left, 0)
        right = min(right, self.n)
        if left >= right:
            return
        root = self.find(left)
        while self.right[root] < right:
            next_root = self.find(self.right[root])
            root = self.merge(root, next_root)

    range_unite = range_merge

    def interval(self, node):
        root = self.find(node)
        return self.left[root], self.right[root]


# haru: pypy
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

class DSU:
    n : int 
    par : list[int]
    siz : list[int]
    fix_leader : bool
    __slots__ = ["n", "par", "siz", "fix_leader"]
    
    def __init__(self, n, fix_leader = False):
        self.n = n
        self.par = [*range(n)]
        self.siz = [1] * n
        self.fix_leader = fix_leader

    def leader(self, a):
        while self.par[a] != a:
            a = self.par[self.par[a]]
            self.par[a] = self.par[self.par[a]]
        return a

    def merge(self, a, b):
        a = self.leader(a)
        b = self.leader(b)
        if a == b: return a
        if self.fix_leader or self.siz[a] > self.siz[b]:
            self.siz[a] += self.siz[b]
            self.par[b] = a
            return a
        else:
            self.siz[b] += self.siz[a]
            self.par[a] = b
            return b

    def same(self, a, b):
        return self.leader(a) == self.leader(b)
    
    def size(self, a):
        return self.siz[self.leader(a)]
    
    def groups(self):
        res = [[] for i in range(self.n)]
        for i in range(self.n):
            res[self.leader(i)].append(i)
        res2 = []
        for i in range(self.n):
            if len(res[i]) > 0:
                res2.append(res[i])
        return res2

"""
最後の操作は大きい方
その直前は「それにつながる任意の操作」みたいなのができるはず
いい感じの有向木であることが必要？

\sum d[i] * a[i] - \sum_{not root} -1)

辺ごとに a[u] + a[v] として - 

全方位ならかなり嫌 <- 木じゃないですよ
"""

def solve():
    n, m = MI()
    a = LI()
    
    e = []
    for i in range(m):
        u, v = MI_1() 
        e.append((a[u] + a[v], u, v))
    e.sort(reverse=True)
    
    ans = -sum(a)
    uf = DSU(n)
    for w, u, v in e:
        if uf.same(u, v): continue
        ans += w
        uf.merge(u, v)
    
    for g in uf.groups():
        ans += max(a[i] for i in g)
    
    print(ans)
    return

t = int(input())
for i in range(t):
    solve()