#include<bits/stdc++.h>
using namespace std;
#define AIN(a,n,b) assert(a<=n && n<=b)
#define i64 long long
#define MAX 36
#define MAXV 1000000
#define inf 1000000000

int mat[MAX][MAX],dp[1<<(MAX/2)][2],n;
void warshall(int n){
    int i,j,k;
    for(k = 0;k<n;k++){
        for(i = 0;i<n;i++){
            for(j = 0;j<n;j++){
                mat[i][j] = min(mat[i][j],mat[i][k] + mat[k][j]);
            }
        }
    }
    for(i = 0;i<n;i++){
        for(j = 0;j<n;j++){
            AIN(0,mat[i][j],inf - 1);
        }
    }
}
int solve(int mask,int fl){    // computes the minimum weighted matching
                               // mask contains information about which nodes are free
                               // and which node pair is already matched
                               // if fl == 0 that means we are computing for even nodes otherwise for odd nodes
    if(mask + 1 == (1<<(n/2)))
        return 0;
    int &ret = dp[mask][fl];
    if(ret!=-1) return ret;
    ret = inf;
    int i,j;
    for(i = 0;i*2+fl<n;i++){
        if(mask & (1<<i)) continue;
        for(j = i+1;j*2+fl<n;j++){
            if(mask & (1<<j)) continue;
            ret = min(ret,solve(mask | ((1<<i) | (1<<j) ),fl)+mat[2*i+fl][2*j+fl]);
        }
        break;    // matching order does not matter, so do not take a edge several time and make the loop n^2
    }
    return ret;
}
int main(){
    int t,i,j,u,v,m,c;

    scanf("%d",&t);
    AIN(1,t,50);
    while(t--){
        scanf("%d %d",&n,&m);
        n*=2;
        assert(n%4==0);
        AIN(1,n,MAX);
        AIN(1,m,(n*(n-1)/2));
        for(i = 0;i<n;i++){
            for(j = 0;j<n;j++)
                mat[i][j] = inf;
            mat[i][i] = 0;
        }
        for(i = 0;i<m;i++){
            scanf("%d %d %d",&u,&v,&c);
            AIN(0,u,n-1);
            AIN(0,v,n-1);
            AIN(1,c,MAXV);
            mat[u][v] = mat[v][u] = c;
        }
        warshall(n); // compute the all pair shortest path in whole graph
        memset(dp,-1,sizeof(dp));

        printf("%d\n",min(solve(0,0),solve(0,1))); // assign even nodes as Radiant and calculate
                                                  // and odd nodes as Radiant again and calculate
                                                   // take the minimum
    }
    return 0;
}