#include<bits/stdc++.h>
using namespace std;
int m(vector<int>& A){
    unordered_map<int,int> a;
    int b = 0;
    for (int i=0;i<A.size();++i){
        if(a.find(A[i])!=a.end()){
            int a=a[A[i]];
            if (a>0&&A[a-1]==A[i]){
                b+=A[i];
            }
        }
        last_index[A[i]]=i; 
    }
    return b;
}
int main(){
    int T;
    cin>>T;
    while (T--){
        int n;
        cin>>n;
        vector<int> A(n);
        for (int i=0;i<n;++i){
            cin>>A[i];
        }
        cout<<m(A)<<endl;
    }
    return 0;
}