Path in Tree is Unique

Theorem
Let $T$ be a graph.

Then $T$ is a tree iff there is exactly one path between any two vertices.