Path in Tree is Unique/Necessary Condition/Statement

Theorem

Let $T$ be a tree.

Let $u$ and $v$ be distinct vertices of $T$.

Then there is exactly one path between $u$ and $v$.