import sys
import typing


class DSU:
    '''
    Implement (union by size) + (path halving)

    Reference:
    Zvi Galil and Giuseppe F. Italiano,
    Data structures and algorithms for disjoint set union problems
    '''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a: int, b: int) -> int:
        x = self.leader(a)
        y = self.leader(b)

        if x == y:
            return x

        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x

        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x

        return x

    def same(self, a: int, b: int) -> bool:
        return self.leader(a) == self.leader(b)

    def leader(self, a: int) -> int:
        parent = self.parent_or_size[a]

        while parent >= 0:
            if self.parent_or_size[parent] < 0:
                return parent

            self.parent_or_size[a], a, parent = (
                self.parent_or_size[parent],
                self.parent_or_size[parent],
                self.parent_or_size[self.parent_or_size[parent]]
            )

        return a

    def size(self, a: int) -> int:
        return -self.parent_or_size[self.leader(a)]

    def groups(self) -> typing.List[typing.List[int]]:
        leader_buf = [self.leader(i) for i in range(self._n)]

        result: typing.List[typing.List[int]] = [
            [] for _ in range(self._n)
        ]

        for i in range(self._n):
            result[leader_buf[i]].append(i)

        return list(filter(lambda r: r, result))


def main() -> None:
    input = sys.stdin.buffer.readline

    ttt = int(input())

    for _ in range(ttt):
        n, m = map(int, input().split())
        a = list(map(int, input().split()))

        edges = []
        ans = 0

        for i in range(n):
            edges.append((a[i], n, i))
            ans -= a[i]

        for _ in range(m):
            u, v = map(int, input().split())
            u -= 1
            v -= 1
            edges.append((a[u] + a[v], u, v))

        # C++の ranges::sort(edges, greater{}) と同じく、
        # 3要素全体を辞書順の降順でソートする
        edges.sort(reverse=True)

        uf = DSU(n + 1)

        for w, u, v in edges:
            if not uf.same(u, v):
                ans += w
                uf.merge(u, v)

        print(ans)


if __name__ == '__main__':
    main()