Number of Pairs of Template Matchings in $q$-ary Tree with Randomly Marked Vertices

Let the vertices of a complete q-ary tree be assigned independent random marks having uniform distribution on a finite alphabet. We consider pairs of identically marked embeddings of a given subtree template. An asymptotic formula for the expectation of the number of such pairs is obtained and the Poisson limit theorem for this number is proposed.