Given a tree of 'N' nodes , undirected , answer 'M' queries on the tree.

Root is node - '1'.

1<=N<=100000

1<=M<=100000

EDGES = N - 1 .

Each node is assigned a character('a'-'z')

In each query , we are given an integer 'x' , we have to find all good nodes starting from node 'x' to/till root , such that the path starting from 'x' to node 'v'(v is the good node) , is a palindromic path.

A palindromic path in a tree is a path whose letters can be re arranged to form a palindrome.