Path in Tree is Unique/Sufficient Condition/Statement

Theorem
Let $T$ be a graph.

Let $T$ be such that between any two vertices there is exactly one path.

Then $T$ is a tree.