Isomorphism and Subgraphs · Challenge problem

The triangular prism has two triangles $123$, $456$ joined by the matching $14,25,36$ ($9$ edges total). What is the minimum number of edges you must add to the $3$ disjoint edges $12,34,56$ (keeping them, and possibly relabeling) to reach a graph isomorphic to the prism?