?
#include #include #include #include #include #include #include #include #include #include #include #define INF 100000000 using namespace std; int n,m,r; struct node{ int x,y,w; bool operator < (const node &a)const{ return w < a.w; } }; int fa[20005]; int fun(int x){ if(fa[x] == x) return x; else return fa[x] = fun(fa[x]); } int main(){ int t; cin >> t; while(t--){ priority_queue que; scanf("%d%d%d",&n,&m,&r); for(int i = 0;i < r;i++){ node cc; scanf("%d%d%d",&cc.x,&cc.y,&cc.w); cc.y += 10000; que.push(cc); } long long int ans = 0; for(int i = 0;i < n;i++){ fa[i] = i; } for(int i = 10000;i < m+10000;i++){ fa[i] = i; } while(!que.empty()){ node cc = que.top(); que.pop(); if(fun(cc.x) != fun(cc.y)){ fa[fun(cc.x)] = fun(cc.y); ans += cc.w; } } cout << (long long)(n+m)*10000- ans << endl; } return 0; }