Path in Tree is Unique/Sufficient Condition/Statement

Theorem

Let $T$ be a graph.

Let $T$ be such that between every pair of distinct vertices of $T$ there exists exactly one path.

Then $T$ is a tree.