For a given integer, n, and an array, edges, return the number of connected components in a graph containing n nodes.

Note: The array edges[i] = [x, y] indicates that there’s an edge between x and y in the graph.

Constraints:

• $1 \leq$ n $\leq 2000$

• $0 \leq$ edges.length $\leq 1000$

• edges[i].length $== 2$

• $0 \leq$ x $,$ y $\lt$ n

• x $\neq$ y

• There are no repeated edges.

Implement your solution in main.py in the following coding playground. You will need the provided supporting code to implement your solution.

Note: To solve this problem, you may need to change the implementation of the functions in the given Union Find class.