Let $G$ be a connected $U-W$ bipartite graph (i.e., a connected bipartite graph with parts $U$ and $W$). Assume that the cardinalities of $U$ and of $W$ are equal and $\geq 2$. Assume also that the degrees of the vertices in $U$ are all different.
Prove that $G$ contains a perfect matching.
Could anyone help me this question?