시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 256 MB 0 0 0 0.000%

문제

Located at the easternmost tip of Shandon Peninsula, Weihai is one of the most famous tourist destinations all over China. There are beautiful hills, seas, bays, springs, islands, and beautiful beaches in Weihai. It is also a coastal city abundant in seafood, including prawn, sea cucumber, abalone, shellfish, and algae.

Attracted by the distinctive scenery and pleasant environment, three theoretical computer scientists plan to have a trip to Weihai. However, they cannot reach a consensus on accommodation, since some people prefer some hotels while other people like others. They decide to stay in possibly different hotels at night and meet in one hotel the next day. The hotel they meet may not necessarily be one of the hotels they stay in.

There are some roads connecting the hotels in Weihai. The roads are specially designed such that there is a unique path between every pair of hotels. Every theoretical computer scientist has prepared a list of candidate hotels before their trip starts. When they arrive in Weihai, each of them will uniformly and independently choose one hotel from the candidate hotel list. Also, they will meet in a hotel such that the total length of their routes is minimized. As a member of the theoretical computer science group, can you tell the expected total length of their routes?

입력

The first line of the input contains a single integer $n$ $(1 \leq n \leq 200\;000)$, denoting the number of hotels in Weihai. Then follow $n-1$ lines, describing the roads connecting the hotels. Each of the $n-1$ lines contains three integers $u, v, w$ $(1 \leq u, v \leq n, u \neq v, 1 \leq w \leq 1000)$, denoting a road of length $w$ connecting the hotels numbered $u$ and $v$. It is guaranteed that there is a unique path between every pair of hotels.

The last three lines of the input specify the candidate hotel lists, one for each theoretical computer scientist. Each line begins with a single integer $m$ $(1 \leq m \leq n)$ and $m$ distinct integers $a_1, a_2, \cdots, a_m$ $(1 \leq a_i \leq n)$, meaning that the candidate hotel list contains the hotels numbered $a_1, a_2, \cdots, a_m$.

출력

Print the expected total length of their routes within an absolute or relative error of no more than $10^{-6}$.

예제 입력 1

3
1 2 1
2 3 2
1 1
1 2
1 3

예제 출력 1

3

예제 입력 2

5
1 2 3
1 3 5
2 4 7
2 5 11
3 2 4 5
4 1 2 3 5
2 1 3

예제 출력 2

13.958333333333