#include <stdio.h>
#include <vector>
#include <algorithm>
typedef long long ll;

const int MAXN = 100010;
int T, n, m, tot, a[MAXN], fa[MAXN], h[MAXN];//h[i]表示集合i中最小的点的亮度
ll ans;
bool vis[MAXN];
std::vector<int> e[MAXN];

void insert(int u, int v) {
    e[u].push_back(v);
    e[v].push_back(u);
}

bool cmp(int p, int q) {
    return h[p] > h[q];
}

int getfa(int x) {
    if (fa[x] == x) return x;
    return fa[x] = getfa(fa[x]);
}

void merge(int u, int v) {
    int x = getfa(u), y = getfa(v);
    if (x != y) {
        ans += abs(h[x] - h[y]);
        fa[y] = x;
        h[x] = std::min(h[x], h[y]);
    }
}

int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; ++i) {
            e[i].clear();
            fa[i] = i;
            vis[i] = false;
            scanf("%d", &h[i]);
            a[i] = i;
        }
        int u, v;
        for (int i = 1; i <= m; ++i) {
            scanf("%d%d", &u, &v);
            insert(u, v);
        }
        ans = 0;
        std::sort(a + 1, a + n + 1, cmp);
        for (int i = 1; i <= n; ++i) {
            u = a[i];
            vis[u] = true;
            for (auto v : e[u]) {
                if (vis[v]) {
                    merge(u, v);
                }
            }
        }
        for (int i = 1; i <= n; ++i) {
            if (getfa(i) == i) {
                ans += h[i];
            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}