DSU problem (HELP)

SETELE unable to understand the editorial approach
CMST​ is the MST cost of the original graph (i.e. just the sum of the costs of all edges).
SSS is the sum of the largest edge weight across all paths.
T is the number of paths (i.e. N(N−1)/2N(N-1)/2N(N−1)/2).

can anyone explain with better example??