Problem D
Aqueduct Construction
After conquering Britannia, the great Roman general Agricola decided all of his new cities should take advantage of the natural springs found aplenty. He appointed his advisor Wessus Waterus to try to find a way to get each town a fresh supply of water.
There are many springs and many towns and between each are the natural hills and valleys of Roman Britain. Wessus doesnâ€™t want to waste the Imperial coin. He has been tasked with linking each town to a spring by a series of aqueducts using as little material as possible. Water, as we know, only flows downhill so any aqueduct must go from a higher point to a lower; intervening hills, springs and towns are no problem since they can be tunnelled through and on. The only requirement is that all aqueduct components start and end on hilltops.
Any spring must only serve one town, but the Romans are clever enough to find a way for aqueducts to pass each other. Roman engineering is excellent, but has its limits: aqueducts can only be of a limited length.
Input

One line containing four integers: $n,s,t$ and $q$ where $0 < n \le 500$ is the number of hills, $1 \le s \le 40$ is the number of springs, $1 \le t \le s$ is the number of towns and $q$ ($1 \le q \le 3\cdot 10^6$) is the maximum aqueduct length.

$N$ more lines, each giving the spaceseparated integers $x_ i, y_ i, h_ i$: the coordinates and height of a hill ($0 \le x, y, h \le 10^6$). These hills are numbered $1$ to $n$ in the order given.

One line containing $s$ spaceseparated integers $i_ j$ ($1 \le i_ j \le n$), each representing the number of a hill on which a spring can be found.

One line containing $t$ spaceseparated integers $i_ j$ ($1 \le i_ j \le n$), each giving the number of a hill on which the town can be found.
Each hill may only have at most one spring or one town.
Output
Output one line with one real number, denoting the minimum total length of all aqueducts needed to supply each town with fresh water from its own unique spring or IMPOSSIBLE if there is no way to achieve this. Your answer should be correct up to an absolute or relative precision of $10^{6}$.
Sample Input 1  Sample Output 1 

6 2 2 8 0 0 6 3 4 7 0 8 8 6 8 8 6 0 6 6 4 8 3 4 1 5 
20.396078 
Sample Input 2  Sample Output 2 

4 2 2 3 1 3 2 3 3 2 2 1 1 2 6 1 1 2 3 4 
IMPOSSIBLE 