WA in DST

[susi_45]

I am getting WA in problem DST.
My approach for the problem is :

1. Sort all edges for each node.
2. Starting from root run a DFS.
3. Check if DFS traversal has required pattern as subsequence.
4. Whenever required pattern is found stop.
5. Find route from root to the node and continue up to a leaf node by traversing in similar fashion.

Here is link to my Code. Can anyone tell if my approach is wrong or the implementation?
Any test case where my solution fails will be helpful.
Thanks in advance