Problem #PRU-30785

Problem

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