Description
Farmer John’s cows refused to run in his marathon since he chose a path much too long for their leisurely lifestyle. He therefore wants to find a path of a more reasonable length. The input to this problem consists of the same input as in “Navigation Nightmare”,followed by a line containing a single integer K, followed by K “distance queries”. Each distance query is a line of input containing two integers, giving the numbers of two farms between which FJ is interested in computing distance (measured in the length of the roads along the path between the two farms). Please answer FJ’s distance queries as quickly as possible!
Input
 Lines 1..1+M: Same format as “Navigation Nightmare”
 Line 2+M: A single integer, K. 1 <= K <= 10,000
 Lines 3+M..2+M+K: Each line corresponds to a distance query and contains the indices of two farms.
Output
 Lines 1..K: For each distance query, output on a single line an integer giving the appropriate distance.
Sample Input
7 6
1 6 13 E
6 3 9 E
3 5 7 S
4 1 3 N
2 4 20 W
4 7 2 S
3
1 6
1 4
2 6
Sample Output
13
3
36
Hint
Farms 2 and 6 are 20+3+13=36 apart.
Source
 无向树求节点距离：
dist(u,v)=dist(root,u)+dist(root,v)2*dist(root,lca(u,v))
 tarjan+并查集求LCA。注意可能树不连通。


另外，还可以转化为RMQ问题求解：

