Equivalent Suffix Tries

Suffix trees are very powerful data structures. Using suffix trees it's often easy to solve the hardest computer science problems on strings. In this problem we'll consider a simplified version of suffix trees -- suffix tries (that is, tries formed by all suffixes of a given string). Generally, the suffix tree is a tree whose edges are labeled with strings. Instead, we'll only consider suffix tri