#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll>pi; typedef complex<double>cx;
#define int ll
#define X first
#define Y second
#define fer(i,a,n) for(int i=a;i<=n;i++)
#define ref(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define mem(a,x) memset(a,x,sizeof a)
#define ac IO;int t;cin>>t;while(t--)solve()
#define AC signed main(){IO;solve();}
#define NO {cout<<"NO"<<endl;return;}
#define YES {cout<<"YES"<<endl;return;}
#define re(a) {cout<<a<<endl;return;}
#define all(v) v.begin(),v.end()
//ofstream fout("1.out", ios::out);
//ifstream fin("1.in", ios::in);
//#define cout fout
//#define cin fin
//--------------------瑞神神中神--------------------

const int N=2e5+10;
int low[N],dfn[N];
vector<pi>e[N];
set<int>vec;
int n,m,tim,cnt;

void tarjan(int u,int fa)
{
    low[u]=dfn[u]=++tim;
    for(auto[v,w]:e[u])
    {
        if(v==fa)continue;
        int tmp=cnt++;
        if(!dfn[v])
        {
            tarjan(v,u);
            low[u]=min(low[u],low[v]);
            if(low[v]>dfn[u]&&(tmp&1))
            {
                vec.erase(w);
            }
        }
        else if(dfn[v]<dfn[u])
        {
            low[u]=min(low[u],dfn[v]);
        }
    }
}

void solve()
{
    cin>>n>>m;
    int ans=0;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        ans+=c;
        e[a].emplace_back(b,c);
        e[b].emplace_back(a,c);
        vec.insert(c);
    }
    if(!(m&1))
    {
        cout<<ans<<'\n';
        return;
    }
    tarjan(1,0);
    ans-=*vec.begin();
    cout<<ans<<'\n';
}

AC