HDU 6958 KD-Graph(带权并查集)
题目链接:KD-GraphProblem DescriptionLet’s call a weighted connected undirected graph of n vertices and m edges KD-Graph, if thefollowing conditions fulfill:n vertices are strictly divided into K groups, each group contains at least one verticeif verti