The graph G contains at least two vertices. One vertex has degree one, and every other vertex has degree greater than 1. Show that G contains a cycle.

I was able to see that it was the case by drawing, but I need help getting started with the proof.

I tried to make a connection with the theorem that says any walk starting with an odd degree must end in another odd degree vertex, but failed.