Every Tree Must Have at Least Two Vertices of Degree

Multiple Choice

Every tree must have at least two vertices of degree one.

A) This statement is always true.
B) This statement is always false.
C) This statement is only true if there are more than four vertices.
D) This statement is only false if there are more than four vertices.
E) None of the above.