It seems the part that says every vertex in H has degree at least two is not necessarily true. The paths could converge prior to seeing vertex v, thus resulting in at least one vertex having degree 1. Therefore the minimum degree is not necessarily 2, meaning it is still possible for H to have at least 2 leaves, therefore this proof is incorrect. Is this reasoning correct?