Cafebazaar

You are the product manager of Cafebazaar, an Android marketplace in Iran. As your one-year plan you have a list of applications to develop, and you have to assign a suitable developer to each application on the list. Cafebazaar has $n$ developers, some of them full time and the rest part time. Your list holds $m$ applications, some of them business critical and the rest ordinary applications.

Developers have different skills. A developer handles some applications well and cannot develop others at all. If developer $i$ is capable of developing application $j$, then assigning her to that application in your plan gains you a payoff of $x_{i,j}$. You cannot assign a developer to an application she is not capable of developing. To save time and cost you assign each developer to at most one application, and at most one developer to each application.

A development plan is proper when both of the following hold. First, every full-time developer takes part in the plan, so nobody gets disappointed. Second, every critical application has a developer assigned to it, so you do not lose clients. In other words, each full-time developer is assigned to exactly one application, and each critical application has exactly one developer assigned to it. A proper plan may also assign part-time developers to applications, and it may assign developers to ordinary applications. Find a proper plan whose total payoff is maximum.

The input holds several test cases. The first line of each test case has two space-separated integers $n$ and $m$, the number of developers and the number of applications ($1 \le n, m \le 100$). The next line starts with the number of full-time developers $t$ ($0 \le t \le n$), followed by the indices of the $t$ full-time developers. Developers are indexed from 1 to $n$. The next line starts with the number of critical applications $s$ ($0 \le s \le m$), followed by the indices of the $s$ critical applications. Applications are indexed from 1 to $m$. The next $n$ lines hold one line of information per developer. Line $i$ ($1 \le i \le n$) starts with the number of applications developer $i$ is capable of developing, $d_i$ ($0 \le d_i \le m$), followed by $d_i$ pairs of integers $a_{i,j}$ and $x_{i,j}$ ($1 \le j \le d_i$, $1 \le a_{i,j} \le m$, $1 \le x_{i,j} \le 10^6$). Here $a_{i,j}$ is the index of an application developer $i$ is capable of developing, and $x_{i,j}$ is the payoff gained when developer $i$ develops application $a_{i,j}$. The same application index never appears twice in the list of one developer. The last line of the input is 0 0 and is not processed. The input holds at most 20 test cases.

For each test case print on one line the maximum total payoff you can obtain with a proper plan. If there is no proper plan, print -1 on that line.