45 Bicycle

/*
    Task    : 48 Bicycle
    Author  : Phumipat C. [MAGCARI]
    Language: C++
    Created : 30 July 2022 [11:03]
*/
#include<bits/stdc++.h>
using namespace std;
struct A{
    int u,v,w;
    bool operator < (const A&o) const{
        return w>o.w;
    }
};
vector<A > edges;
int p[100010];
map<int ,int > mapp;
int fr(int u){
    if(u == p[u])   return u;
    else            return p[u] = fr(p[u]);
}
int main(){
    int q,m,n,num,u,v,w,cnt = 0;
    scanf("%d",&q);
    while(q--){
        scanf("%d %d",&m,&n);
        for(int i=1;i<=m;i++){
            scanf("%d",&num);
            mapp[num] = i;
            p[i] = i;
        }
        for(int i=1;i<=n;i++){
            scanf("%d %d %d",&u,&v,&w);
            edges.push_back({mapp[u],mapp[v],w});
        }
        sort(edges.begin(),edges.end());
        for(auto x:edges){
            int ru = fr(x.u),rv = fr(x.v);
            if(ru != rv){
                p[rv] = ru;
            }else{
                cnt+=x.w;
            }
        }
        printf("%d\n",cnt);
        edges.clear();
        cnt = 0;
    }
    return 0;
}
/*

*/