22/7/18

1，acwing 346.泼水节；

---

1，泼水节；

 思路：因为要做完全图，所以在合并集合时，要把两个集合的所有点对都连一条边，所以

在kruskal合并集合的时候统计加的权值即可；用到了统计集合点数；p[a]=b,siz[b]+=siz[a];

#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rep1(i,a,n) for(register int i=(a);i<(n);++i) 
#define rep2(i,a,n) for(register int i=(a);i<=(n);++i) 
#define per1(i,n,a) for(register int i=(n);i>(a);i--) 
#define per2(i,n,a) for(register int i=(n);i>=(a);i--)
#define quick_cin() cin.tie(0),cout.tie(0),ios::sync_with_stdio(false)
#define memset(a,i,b) memset((a),(i),sizeof (b))
#define memcpy(a,i,b) memcpy((a),(i),sizeof (b))
#define pro_q priority_queue
#define pb push_back
#define pf push_front
#define endl "\n"
#define lowbit(m) ((-m)&(m))
#define dbug(y) cout<<(#y)<<"\n"
#define yi first
#define er second
#define INF 0x3f3f3f3f
#define tulun int e[N],ne[N],h[N],w[N],idx;
#define add2(a,b) e[idx]=b,ne[idx]=h[a],h[a]=idx++;
#define add3(a,b,c) w[idx]=c,e[idx]=b,ne[idx]=h[a],h[a]=idx++;
#define T_solve() int T;cin>>T;while(T--)solve();
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef double dob;
const int N=1e4+10;
struct node
{
    int a,b,w;
    bool operator <(const node &b)
    {
        return w<b.w;
    }
}edge[N];
int edge_num;
int p[N],siz[N];
int find(int x){return p[x]==x?x:p[x]=find(p[x]);}
int n;
int kruskal()
{
    sort(edge+1,edge+n);
    int ans=0;
    rep2(i,1,n-1)
    {
        int a=edge[i].a,b=edge[i].b,w=edge[i].w;
        a=find(a),b=find(b);
        if(a!=b)
        {
            ans+=(siz[a]*siz[b]-1)*(w+1);
            p[a]=b;
            siz[b]+=siz[a];
        }
    }
    return ans;
}
void solve()
{
    cin>>n;
    rep2(i,1,n)p[i]=i,siz[i]=1;
    edge_num=0;
    rep2(i,1,n-1)
    {
        int a,b,w;
        cin>>a>>b>>w;
        edge[i]={a,b,w};
    }
    cout<<kruskal()<<endl;
    
}
signed main()
{
    quick_cin();
    T_solve();
    return 0;
}