#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include <bits/stdc++.h>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define all(a) a.begin(),a.end()
using namespace std;
#define maxn 10005
int n,q;
pair<int,int> a[maxn];
vector<pair<int,ll> > g[maxn];
ll dis[maxn][maxn];
ll dis1[maxn];
int ls[maxn],rs[maxn],tsz = 0,root = 0;
int id[maxn];
void upd(int x,int y,ll w){
g[x].pb({y,w});
}
void init(int &v,int tl,int tr){
if(!v) v = ++tsz;
if(tl==tr){
id[tl] = v;
return;
}
int mid = (tl+tr)/2;
init(ls[v],tl,mid);
init(rs[v],mid+1,tr);
upd(v,ls[v],0);
upd(v,rs[v],0);
}
void upd(int v,int tl,int tr,int l,int r,int u){
if(l>r||l>tr||tl>r||tl>tr) return;
if(tl>=l&&tr<=r){
upd(u,v,0);
return;
}
ll mid = (tl+tr)/2;
upd(ls[v],tl,mid,l,r,u);
upd(rs[v],mid+1,tr,l,r,u);
}
void getdis(int poc){
for(int i = 1;i<=tsz;i++) dis[poc][i] = llinf;
dis[poc][poc] = 0;
deque<ll> pq;
pq.pb(poc);
while(pq.size()){
ll u = pq.front();
pq.pop_front();
for(pll p : g[u]){
ll s = p.fi;
ll w = p.sc;
if(dis[poc][u]+w<dis[poc][s]){
dis[poc][s] = dis[poc][u]+w;
if(w) pq.pb(s);
else pq.push_front(s);
}
}
}
}
ll F[maxn];
int main(){
ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
cin >> n;
init(root,1,n);
for(ll i = 1;i<=n;i++){
cin >> a[i].fi >> a[i].sc;
tsz++;
upd(id[i],tsz,1);
upd(1,1,n,a[i].fi,a[i].sc,tsz);
}
for(ll i = 1;i<=tsz;i++) getdis(i);
for(ll i = 1;i<=tsz;i++) F[i] = -2;
cin >> q;
while(q--){
ll x; cin >> x;
if(F[x]!=-2){
cout<<F[x]<<endl;
continue;
}
ll ans = llinf;
for(ll i = 1;i<=tsz;i++){
ans = min(ans,dis[id[x]][i] + dis[i][id[1]] + dis[i][id[n]]);
}
if(ans==llinf) ans = -1;
F[x] = ans;
cout<<F[x]<<endl;
}
return 0;
}
/**
4
1 3
2 4
2 3
4 4
1
1
**/
