Uniform Random Edges to Connect Node Groups

For this Databricks problem, given n connected components, return exactly n-1 edges to form one graph. Avoid Kruskal biases using Wilson's algorithm.