Super Sale

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1001)
#define MW (32)
#define MP (100)
int dp[MX][MW],p[MX],w[MX],C[MP];
int cbg(int N,int P){
    int S(0),X(*C);
    F(P)X=max(X,C[i]);
    F(N+1)FF(X+1)if(!i||!j)dp[i][j]=0;
               else if(w[i-1]>j)dp[i][j]=dp[i-1][j];
               else dp[i][j]=max(dp[i-1][j],p[i-1]+dp[i-1][j-w[i-1]]);
    F(P)S+=dp[N][C[i]];
    return S;
}
int main(void){
    int N,P;
    IN(tt)F(tt){
        scanf("%d",&N);
        F(N)scanf("%d%d",p+i,w+i);
        scanf("%d",&P),ga(P,C);
        printf("%d\n",cbg(N,P));
    }
    return 0;
}