For a collection $\mathbf{G}=\{G_1,\dots, G_s\}$ of not necessarily distinct graphs on the same vertex set $V$, a graph $H$ with vertices in $V$ is a $\mathbf{G}$-transversal if there exists a bijection $φ:E(H)\rightarrow [s]$ such that $e\in E(G_{φ(e)})$ for all $e\in E(H)$. We prove that for $|V|=s\geq 3$ and $δ(G_i)\geq s/2$ for each $i\in [s]$, there exists a $\mathbf{G}$-transversal that is a Hamilton cycle. This confirms a conjecture of Aharoni. We also prove an analogous result for perfect matchings.