RTREE  Roger and tree
Roger is a computer science student who likes connected undirected acyclic graphs, also known as trees. He especially likes solving problems about trees. Recently Roger found a piece of paper with a rooted tree with 'N' vertices drawn on it (numbered from 1 to 'N'). He also found 'Q' queries on the same piece of paper, where each query was an integer 'S' between 1 to 'N'. But the paper said nothing about the description of the queries. So he decided to find the longest path of each of the subtree 'S'.
Roger spent two sleepless nights trying to solve this problem efficiently. He is still trying and won't sleep until he knows the answer to each query. Write a program which answers all the queries correctly.
Input
The first line contains an integer 'N', then N1 lines follow.
Each of the next 'N1' line contains two integer 'U' and 'V' which means that vertex 'U' and 'V' are connected.
Next line contains an integer 'R' which denotes the root of the tree.
Next line contains another integer 'Q' which denotes the number of queries.
Each of the next 'Q' line contains an integer 'S' between (1 to N).
Output
For each query print the longest path of the subtree 'S' rooted at vertex 'R'.
Output exactly 'Q' lines, each line containing the output of the ith query.
Example
SAMPLE INPUT 3 1 2 1 3 1 2 1 2 SAMPLE OUTPUT 2 0
CONSTRAINTS
1 ≤ N ≤ 10^5
1 ≤ U,V ≤ N
1 ≤ R ≤ N
1 ≤ Q ≤ 10^5
1 ≤ S ≤ N
hide comments
jkks1234:
20181129 15:07:24
There can be many reasons for getting wrong answer on 50th test case.I got 3 wrong answer on 50th test case and all the 3 times the reasons were different.Even a silly program is running till 50 th test case and then giving wrong answer and remember 1 thing you can get longest path from smaller subtree also.


soham_12345:
20180705 08:12:13
used same code for atleast 4 problems xD. AC in 1 go :D 

abdulkader:
20180426 18:34:56
DFS + DP Last edit: 20180426 18:40:37 

be1035016:
20180202 08:58:26
on the first go::come on 47 

sahil_1994:
20171019 22:51:58
what's wrong with 50th case??? anyone please :(


jaideeppyne:
20170927 11:43:50
Unable to resolve WA on 50th test case :( any hints from those who solved ? :/


spoj:
20170319 19:15:15
For ppl getting wrong answer on 50th test case, take max size of array to be 1000010..This helped me!!!


sarthakshah30:
20170309 18:02:53
Getting wrong answer on 50th test case??? please help 

abolfazlb3:
20170305 15:40:56
Whats the matter of 50th test???


ehsanhy:
20170222 09:23:14
I get WA on test 50th .

Added by:  Rana Saha 
Date:  20140826 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Own problem (Codecracker 2014) 