第一行有個T代表測資數目(1 ≤ T ≤ 1000)
每筆次測資第一行有個數字N代表商品數目(1 ≤ N ≤ 1000)
接下來N行有P,W分別代表商品的價值和重量
之後有一行G代表有G個人(1 ≤ G ≤ 100)
接下來G行有每個人的負重(皆小於等於30)

The input consists of T test cases. The number of them (1 ≤ T ≤ 1000) is given on the first line of the input file. Each test case begins with a line containing a single integer number N that indicates the number of objects (1 ≤ N ≤ 1000). Then follows N lines, each containing two integers: P and W.The first integer (1 ≤ P ≤ 100) corresponds to the price of object. The second integer (1 ≤ W ≤ 30)corresponds to the weight of object. Next line contains one integer (1 ≤ G ≤ 100) its the number of people in our group. Next G lines contains maximal weight (1 ≤ MW ≤ 30) that can stand this i-th person from our family (1 ≤ i ≤ G).

輸出最大能拿走多少價值的商品
For every test case your program has to determine one integer. Print out the maximal value of goods which we can buy with that family.

72
514