#include <bits/stdc++.h>
using namespace std;
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define ll long long
#define vi vector<int>
#define pb emplace_back
#define sz(a) ((int) a.size())
#define pii pair<int, int>
#define fi first
#define se second
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int n, m, A, B, C;
int a[200005];
ll s[200005];
vi e[200005];
int dis[3][200005];
void Dijkstra(int s, int *dis) {
    queue<int> que;
    memset(dis, 0x3f, (n + 1) * sizeof (int));
    que.emplace(s);
    dis[s] = 0;
    while (!que.empty()) {
        int u = que.front();
        que.pop();
        for (int v : e[u])
            if (dis[v] == inf)
                dis[v] = dis[u] + 1, que.emplace(v);
    }
}
void Solve() {
    scanf("%d%d%d%d%d", &n, &m, &A, &B, &C);
    L(i, 1, m) scanf("%d", &a[i]);
    sort(a + 1, a + m + 1);
    L(i, 1, m) s[i] = a[i] + s[i - 1];
    L(i, 1, m) {
        int u, v;
        scanf("%d%d", &u, &v);
        e[u].pb(v), e[v].pb(u);
    }
    Dijkstra(A, dis[0]);
    Dijkstra(B, dis[1]);
    Dijkstra(C, dis[2]);
    ll ans = INF;
    L(i, 1, n) {
        ll c0 = dis[0][i];
        ll c1 = dis[1][i];
        ll c2 = dis[2][i];
        if (c0 + c1 + c2 > m) continue;
        ans = min(ans, s[c0 + c1 + c2] + s[c1]);
    }
    printf("%lld\n", ans);
    L(i, 1, n) e[i].clear();
}
int main() {
    int T;
    scanf("%d", &T);
    while (T--)
        Solve();
    return 0;
}