Let $G$ be a connected graph and let $X, Y$ be two disjoint subsets of its vertices, such that there are no edges between them. Given that $G/X$ has $m$ connected components and $G/Y$ has $n$ connected components, what is the minimal number of connected components of the graph $G/(X \cup Y)$?