Finitely many agents have single-peaked preferences on a finite set of alternatives structured as a tree. Under a richness condition on the domain we characterize all unanimous and strategy-proof random social choice functions. These functions are uniquely determined by the values they assign to preference profiles where all peaks are on leafs of the tree.