How far away ?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14859 Accepted Submission(s): 5647
Problem Description
There are n houses inthe village andsome bidirectional roads connecting them. Every day peole always like to ask like this "How far is it if I want to go from house A to house B"? Usually it hard to answer. But luckily int this village the answer is always unique, sincethe roads are built inthe way that there is a unique simple path("simple" means you can't visit a place twice) betweenevery two houses. Yout task isto answer all these curious people.
Input
First line is a single integer T(T<=10), indicating thenumberof test cases.
For each test case,inthefirst line there are two numbers n(2<=n<=40000) and m (1<=m<=200),thenumberof houses andthenumberof queries. The following n-1 lines each consisting three numbers i,j,k, separated bu a single space, meaning that there is a road connecting house i and house j,withlength k(0<k<=40000).The houses are labeled from1to n.
Next m lines each has distinct integers i and j, you areato answer the distance between house i and house j.
Output
For each test case,output m lines. Each line represents the answer ofthe query. Output a bland line after each test case.
Sample Input
23212103115122322121001221
Sample Output
1025100100
How far away ?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14859 Accepted Submission(s): 5647Problem DescriptionThere are n houses in th