Period on tree

You are given an undirected tree of N vertices, each of which edges is marked with some lowercase Latin letter between a and z. It's easy to notice that, if you select some distinct vertices u and v and write down a sequence of characters on the shortest path from u to v, you will get a lowercase string corresponding to this path. Let's call any string t a period of some string s if s can be o