I'm having trouble with this question:
Suppose there is a unique path between any pair of vertices in $G$. Prove that $G$ is a tree.
I know that a path is a trail where all vertices are distinct and a tree is a simple connected graph with no circuits.