Start by implementing the basic Union-Find (Disjoint Set Union) structure with two key optimizations: path compression and union by rank.

For path compression, modify the find operation to flatten the structure of the tree, ensuring future queries are faster.

For union by rank, always attach the shorter tree under the root of the taller tree during union operations to keep the tree balanced, reducing future find operation times.