#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f3f3f3f3f

vi operator *(vi a,vi b){
	if(!a.size()) return {}; if(!b.size()) return {};
	int n=a.size(),m=b.size(),i=1,j=1,k=1,s; vi c(n+m-1);
	s=c[0]=a[0]+b[0];
	while(i<a.size()&&j<b.size()){
		if(a[i]-a[i-1]>=b[j]-b[j-1]) s+=a[i]-a[i-1],c[k++]=s,++i;
		else s+=b[j]-b[j-1],c[k++]=s,++j;
	}
	while(i<a.size()) s+=a[i]-a[i-1],c[k++]=s,++i;
	while(j<b.size()) s+=b[j]-b[j-1],c[k++]=s,++j;
	return c;
}
vi merge(vi a,vi b){
	if(a.size()<b.size())swap(a,b);
	vi c(a);
	for(int i=0;i<b.size();++i)c[i]=max(c[i],b[i]);
	return c;
}
vi operator +(vi a,vi b){
	return merge(a,b);
}
void operator +=(vi&a,vi b){
	if(a.size()<b.size()) a.resize(b.size(),-inf);
	for(int i=0;i<b.size();++i) a[i]=max(a[i],b[i]); 
}
vi push0(vi a){
	int n=a.size(); a.resize(n+1);
	Rep(i,n,1)a[i]=a[i-1]; a[0]=-inf; return a;
}
vi merge(vi a,vi b,int c){
	if(c)return push0(a*b);
	return a*b;
}

struct mat{
	vi f[2][2];
	vi*operator [](int x){return f[x];}
	void print(){
		For(i,0,1)For(j,0,1){
			cout<<"i,j "<<i<<' '<<j<<endl;
			for(auto x:f[i][j])cout<<x<<" ";puts("");
		}puts("-------");
	}
};
mat operator *(mat a,mat b){
	mat c=a;
	For(i,0,1)
		For(j,0,1){
			c[i][j]+=b[i][j];
			For(i1,0,1)
				For(j1,0,1)
					c[i][j1]+=merge(a[i][j],b[i1][j1],j&&!i1);
		}
	return c;
}

char c[maxn];
int p[maxn],n;
mat dfs(int l,int r){
	if(l==r){
		mat f;
		f[c[l]&1][c[l]&1].pb(p[l]);
		return f;
	}
	int mid=l+r>>1;
	return dfs(l,mid)*dfs(mid+1,r);
}

signed main()
{
	n=read();
	For(i,1,n)c[i]=read(),p[i]=read();
	mat f=dfs(1,n);
//	f.print();
	int Q=read();
	For(_,1,Q){
		int k=read(); int res=0;
		For(i,0,1)For(j,0,1)
			if(f[i][j].size())res=max(res,f[i][j][min(k,(int)f[i][j].size()-1)]);
		printf("%lld\n",res);
	}
	return 0;
}