#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Friendship {
    int u, v;
};

void solve() {
    int n, m;
    cin >> n >> m;

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    vector<Friendship> edges(m);
    vector<int> degree(n + 1, 0);

    for (int i = 0; i < m; i++) {
        cin >> edges[i].u >> edges[i].v;
        degree[edges[i].u]++;
        degree[edges[i].v]++;
    }

    if (m % 2 == 0) {
        cout << 0 << "\n";
        return;
    }

    int min_unhappiness = 1e9;

    for (int i = 1; i <= n; i++) {
        if (degree[i] % 2 != 0) {
            min_unhappiness = min(min_unhappiness, a[i]);
        }
    }

    for (int i = 0; i < m; i++) {
        int u = edges[i].u;
        int v = edges[i].v;
        
        if (degree[u] % 2 == 0 && degree[v] % 2 == 0) {
            min_unhappiness = min(min_unhappiness, a[u] + a[v]);
        }
    }

    cout << min_unhappiness << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    if (cin >> t) {
        while (t--) {
            solve();
        }
    }
    return 0;
}