#include <bits/stdc++.h>
using namespace std;

struct Dsu {
    vector<int> pa, rk;
    int CC;
    Dsu(int n) : pa(n), rk(n), CC(0) {
        iota(pa.begin(), pa.end(), 0);
    }
    int anc(int x) {
        return x == pa[x] ? x : pa[x] = anc(pa[x]);
    }
    void join(int x, int y) {
        x = anc(x);
        y = anc(y);
        if (x == y)
            return;
        --CC;
        if (rk[x] < rk[y]) swap(x, y);
        pa[y] = x;
        if (rk[x] == rk[y]) ++rk[x];
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t; cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;
        Dsu dsu(n);
        map<int,vector<int>,greater<>> mp;
        for (int i = 0; i < n; i++) {
            int b;
            cin >> b;
            mp[b].emplace_back(i);
        }
        vector<vector<int>> g(n);
        for (int i = 0; i < m; i++) {
            int u, v;
            cin >> u >> v;
            --u, --v;
            g[u].emplace_back(v);
            g[v].emplace_back(u);
        }
        vector<int> mark(n);
        int lastb = 1e9;
        int64_t ans = 0;
        for (const auto &[b, v]: mp) {
            if (lastb != -1) {
                // cerr << "--- ";
                // cerr << lastb << ' ' << b << ' ' << dsu.CC << endl;
                ans += 1LL * (lastb - b) * dsu.CC;
            }
            lastb = b;
            for (int i: v) {
                dsu.CC += 1;
                mark[i] = true;
            }
            for (int i: v)
                for (int j: g[i])
                    if (mark[j])
                        dsu.join(i, j);
        }
        if (lastb != -1) {
            int b = 0;
            // cerr << "--- ";
            // cerr << lastb << ' ' << b << ' ' << dsu.CC << endl;
            ans += 1LL * (lastb - b) * dsu.CC;
        }
        cout << ans << '\n';
    }
    return 0;
}