#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cstdio>
#include <utility>
#include <iomanip>
#include <assert.h>
#define MP make_pair
#define PB push_back
#define int long long
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef LOCAL
#define debug(x) {cerr <<#x <<" = " <<x <<"\n"; }
#define debug2(x, y) {cerr <<#x <<" = " <<x <<", "<<#y <<" = " <<y <<"\n";}
#define debug3(x, y, z) {cerr <<#x <<" = " <<x <<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<"\n";}
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
using std::cerr;
#else
#define debug(x)
#define debug2(x, y)
#define debug3(x, y, z)
#define debugv(x)
#define cerr if(0)cout
#endif
#define make(type, x) type x; cin>>x;
#define make2(type, x, y) type x, y; cin>>x>>y;
#define make3(type, x, y, z) type x, y, z; cin>>x>>y>>z;
#define make4(type, x, y, z, t) type x, y, z, t; cin>>x>>y>>z>>t;
using std::endl;
using std::cout;
using std::cin;
using std::vector;
using std::set;
using std::map;
using std::pair;
using std::max;
using std::min;
using std::ostream;
using std::fixed;
using std::ios_base;
using std::setprecision;
using std::make_pair;
using std::string;
using std::multiset;
using std::next_permutation;
using std::prev_permutation;
using std::random_shuffle;
using std::greater;
using std::lower_bound;
using std::upper_bound;
using std::reverse;
using std::swap;
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}

const int N = 44;
const int INF = 1e7;
int dis[N][N];
int lay[N];
int best_in_lay[N];
int suf[N];
int val[N];
int best = 0;
vector<int> layers[N];
bool cmp(int a, int b) {
  return val[a] > val[b];
}
int vis[N];
int taken[N];
vector<int> slo[N];
bool Dfs(int v) {
  vis[v] = 1;
  if (v == 2) {
    return true;
  }
  for (auto nei : slo[v]) {
    if (vis[nei] || taken[nei]) {
      continue;
    }
    if (Dfs(nei)) {
      return true;
    }
  }
  return false;
}

void Rec(int layer, int last_v, int act_val) {
  if (best >= act_val + suf[layer]) {
    return;
  }
  if (layer == lay[2]) {
    if (dis[2][last_v] != layer - lay[last_v]) {
      return;
    }
    RE (i, N - 2) {
      vis[i] = 0;
    }
    if (Dfs(1)) {
      maxi(best, act_val);
    }
    return;
  }
  for (int v : layers[layer]) {
    if (dis[v][last_v] != layer - lay[last_v]) {
      continue;
    } else {
      taken[v] = 1;
      Rec(layer + 1, v, act_val + val[v]);
      taken[v] = 0;
    }
  }
  Rec(layer + 1, last_v, act_val);
}
    
      

#undef int
int main() {
#define int long long

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  double beg = 1.0 * clock() / CLOCKS_PER_SEC;
  
  make(int, t);
  RE (tt, t) {
    make2(int, n, m);
    FOR (i, 3, n) {
      cin>>val[i];
    }
    RE (i, n) {
      RE (j, n) {
        dis[i][j] = N;
      }
      dis[i][i] = 0;
      slo[i].clear();
    }
    RE (i, m) {
      make2(int, a, b);
      dis[a][b] = dis[b][a] = 1;
      slo[a].PB(b);
      slo[b].PB(a);
    }
    RE (k, n) {
      RE (i, n) {
        RE (j, n) {
          mini(dis[i][j], dis[i][k] + dis[k][j]);
        }
      }
    }
    
    REP (i, N) {
      layers[i].clear();
    }
    
    RE (i, n) {
      lay[i] = dis[1][i];
      layers[lay[i]].PB(i);
    }
    
    FORD (i, n, 0) {
      sort(layers[i].begin(), layers[i].end(), cmp);
      if (SZ(layers[i])) {
        suf[i] = suf[i + 1] + val[layers[i][0]];
      }
    }
    
    //was.clear();
    best = 0;
    //dfs1(0, 1, 0, vector<int>{1});
    Rec(0, 1, 0);
    cout<<best<<endl;
  }

  return 0;
}