Problem #PRU-30784

Problem

Prove that a graph, in which every two vertices are connected by exactly one simple path, is a tree.