The city of "World Cup" has recently become a popular city to live in. There are districts, which are connected by bidirectional ways. Every district is reachable from others. The government of "World Cup" has tasks to do. For each task, they have a set of residents and they have to calculate the sum of distances between each pair of residents. (It's possible to have more than one resident from one district in each task).

Input Format

First line contains and .
Next line contains , and , there is a way between district and size of .
For each task:
   First line contain , size of set.
   Second line contain integers, integer is district where resident lives.

Constraints:



answer for each task
For full score: Set sizes
For 50% score: Set sizes

Output Format

For each task, print sum of distances between each pair of resident.

Sample Input

7 2
1 2 2
2 3 2
2 4 2
1 5 1
2 6 2
2 7 1
3
4 7 1
3
4 6 5

Sample Output

10
14

Explanation

First answer is:

distance(4,7) + distance(4,1) + distance(7,1) = 3 + 4 + 3 = 10.

Second answer is:

distance(4,6) + distance(4,5) + distance(6,5) = 4 + 5 + 5 = 14.
Line: 1 Col: 1
  1. Challenge Walkthrough
    Let's walk through this sample challenge and explore the features of the code editor.1 of 6
  2. Review the problem statement
    Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
  3. Choose a language
    Select the language you wish to use to solve this challenge.3 of 6
  4. Enter your code
    Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
  5. Test your code
    You can compile your code and test it for errors and accuracy before submitting.5 of 6
  6. Submit to see results
    When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
  1. Check your score