Isomorphism and Subgraphs · Easy problem

Graph $G$ has vertices $1,\ldots,6$ and edges $12,13,23,45,56$ (a triangle on $\{1,2,3\}$ and a path on $\{4,5,6\}$, with no edges between the two groups). Graph $H$ has the same $6$ vertices and edges $12,23,34,45,56,16$ (a single $6$-cycle). By how much do the numbers of connected components of $G$ and $H$ differ?