Sentence:  Step 3: Output the tree T. The edge lengths of T are determined recursively: If (x,y) is a <WSD>cherry</WSD> connected to node z as in Step 2… 
Meaning of the word marked with <WSD> tags:  A subtree consisting of a node with exactly two leaves.