#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline int lg2(int x){ return 31^__builtin_clz(x); }
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
const ll INF = 1e16;
int n,a,b; ll val[800005];
void init(){ val[0] = INF; }
struct Int{
	ll w; int l,r;
	Int(){}
	Int(int L,int R,ll W){ l=L,r=R,w=W; }
	bool operator< (const Int &B) const{
		return w<B.w;
	}
	Int operator+ (const Int &B) const{
		return Int(min(l,B.l), max(r,B.r), w+B.w);
	}
};
struct Info{
	Int l,r,ans,sum;
	Info(){}
	Info(Int A){ l=r=ans=sum=A; }
	Info(Int A,Int B,Int C,Int D){ l=A,r=B,ans=C,sum=D; }
	Info operator+ (const Info &B) const{
		return Info(max(l,sum+B.l), max(B.r,B.sum+r), max({ans,B.ans,r+B.l}), sum+B.sum);
	}
};
struct Tree{
	Info s[2];
}tr[800005];
bool tag[800005];
void pushup(int pos){
	for(auto k: {0,1})
		tr[pos].s[k]=tr[pos<<1].s[k]+tr[pos<<1|1].s[k];
}
void upd(int pos){
	swap(tr[pos].s[0], tr[pos].s[1]);
	tag[pos]^=1;
}
void pushdown(int pos){
	if(tag[pos]){
		upd(pos<<1), upd(pos<<1|1);
		tag[pos]=0;
	}
}
void modify(int l,int r,int ql,int qr,int pos){
	if(ql<=l && r<=qr){
		upd(pos);
		return;
	}
	int mid=(l+r)>>1;
	pushdown(pos);
	if(ql<=mid) modify(l,mid,ql,qr,pos<<1);
	if(mid<qr)  modify(mid+1,r,ql,qr,pos<<1|1);
	pushup(pos);
}
void build(int l,int r,int pos){
	if(l==r){
		tr[pos].s[0]=Info(Int(l,l,val[l]));
		tr[pos].s[1]=Info(Int(l,l,-val[l]));
		return;
	}
	int mid=(l+r)>>1;
	if(l<=mid) build(l,mid,pos<<1);
	if(mid<r)  build(mid+1,r,pos<<1|1);
	pushup(pos);
}
ll ans[200005];
void procedure(){
	n=read(); ll res=0;
	for(int i=1;i<=n;i++){
		a=read(), b=read();
		if(!a) val[i]=b; else val[i]=-b, res+=b;
	}
	build(0, n, 1);
	for(int k=0;k<=n;k++){
		Int cur = tr[1].s[0].ans;
		if(cur.w > 0){
			ans[k] = ans[k-1] + cur.w;
			modify(0, n, cur.l, cur.r, 1);
		}else ans[k] = ans[k-1];
	}

	int q=read();
	while(q--){
		int k=read();
		printf("%lld\n", ans[k]-INF+res);
	}
}
int main(){
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}