#include <bits/stdc++.h>
using namespace std;
#define ldb double
#define pb push_back

struct p3{
	ldb x,y,z;

	p3():x(0),y(0),z(0){}
	p3(ldb a,ldb b,ldb c):x(a),y(b),z(c){}

	p3 cross(p3 p) {
		return p3(y*p.z-z*p.y, z*p.x-x*p.z, x*p.y-y*p.x);
	}
};

p3 operator + (p3 a,p3 b){return p3(a.x+b.x,a.y+b.y,a.z+b.z);}
p3 operator - (p3 a,p3 b){return p3(a.x-b.x,a.y-b.y,a.z-b.z);}
p3 operator * (p3 a,ldb b){return p3(a.x*b,a.y*b,a.z*b);}
p3 operator / (p3 a,ldb b){return p3(a.x/b,a.y/b,a.z/b);}
ldb dot(p3 a,p3 b){return a.x*b.x+a.y*b.y+a.z*b.z;}
ldb abs(p3 a){return sqrt(dot(a,a));}

const int N=100050;
int x[N],y[N],z[N];
int myFace[N];



const int M=1e6+50;
vector<pair<int,int>> Edge[M];
vector<pair<int,array<ldb,3>>> Formula[M];
vector<pair<int,int>> Qs[M];


map<pair<int,int>,int> edg;
void Check(int i,int a,int b){
	if(a>b)swap(a,b);
	if(edg[{a,b}]){
		Edge[max(z[a],z[b])].pb({i,edg[{a,b}]});
	}
	edg[{a,b}]=i;
}

int p[N];
ldb coef[N][3];
int Find(int x){return p[x]==x?x:p[x]=Find(p[x]);}
void Union(int x,int y){
	x=Find(x);
	y=Find(y);
	if(x==y)return;
	for(int i=0;i<3;i++){
		coef[y][i]+=coef[x][i];
	}
	p[x]=y;
}

void AddFormula(int i,int z,ldb a,ldb b,ldb c){
	Formula[z].pb({i,{a,b,c}});
}

void AddTriangle(int i,p3 A,p3 B,p3 C){
	ldb area=abs((B-A).cross(C-A))/2;
	ldb hmax=max({A.z,B.z,C.z});
	ldb hmin=min({A.z,B.z,C.z});
	if(A.z<B.z)swap(A,B);
	if(B.z<C.z)swap(B,C);
	if(A.z<B.z)swap(A,B);
	//printf("triangle area: %lf, hmax:%lf, hmin:%lf\n",area,hmax,hmin);
	if(round(A.z)==round(B.z)){
		ldb ml=area/(hmax-hmin)/(hmax-hmin);
		ldb a=area-hmin*hmin*ml;
		ldb b=2*hmin*ml;
		ldb c=-ml;
		//printf("%lf = %lf\n",area,a+hmin*b+hmin*hmin*c);
		AddFormula(i,round(hmax),a,b,c);
		AddFormula(i,round(hmin),-a,-b,-c);
	}else{
		ldb ml=area/(hmax-hmin)/(hmax-hmin);
		ldb a=hmax*hmax*ml;
		ldb b=-2*hmax*ml;
		ldb c=ml;
		//printf("%lf = %lf\n",area,a+hmin*b+hmin*hmin*c);
		AddFormula(i,round(hmax),a,b,c);
		AddFormula(i,round(hmin),-a,-b,-c);
	}
}

ldb ans[N];
int main(){
	int n;
	scanf("%i",&n);
	for(int i=1;i<=n;i++){
		scanf("%i %i %i",&x[i],&y[i],&z[i]);
	}
	int m;
	scanf("%i",&m);
	ldb totalArea=0;
	for(int i=1;i<=m;i++){
		int a,b,c;
		scanf("%i %i %i",&a,&b,&c);
		Check(i,a,b);
		Check(i,b,c);
		Check(i,c,a);
		myFace[a]=i;
		myFace[b]=i;
		myFace[c]=i;
		int mxz=max({z[a],z[b],z[c]});
		int mnz=min({z[a],z[b],z[c]});

		p3 A=p3(x[a],y[a],z[a]);
		p3 B=p3(x[b],y[b],z[b]);
		p3 C=p3(x[c],y[c],z[c]);

		ldb area=abs((B-A).cross(C-A))/2;
		totalArea+=area;
		//printf("face %i: area:%lf\n",i,area);
		if(mxz==mnz){
			AddFormula(i,mxz,area,0,0);
		}else{
			int mid=0;
			if(z[a]!=mnz && z[a]!=mxz)mid=a;
			if(z[b]!=mnz && z[b]!=mxz)mid=b;
			if(z[c]!=mnz && z[c]!=mxz)mid=c;

			if(mid){
				if(z[a]<z[b])swap(a,b);
				if(z[b]<z[c])swap(b,c);
				if(z[a]<z[b])swap(a,b);
				A=p3(x[a],y[a],z[a]);
				B=p3(x[b],y[b],z[b]);
				C=p3(x[c],y[c],z[c]);
				p3 M=C+(A-C)*(z[b]-z[c])/(z[a]-z[c]);
				ldb area2=abs((M-B).cross(A-B))/2;
				AddTriangle(i,A,B,M);
				AddFormula(i,z[b],area2,0,0);
				AddTriangle(i,B,M,C);
				AddFormula(i,z[c],-area2,0,0);
			}else{
				AddTriangle(i,A,B,C);
			}

			AddFormula(i,mnz,area,0,0);
		}
	}

	//printf("total area: %lf\n",totalArea);

	for(int i=1;i<=m;i++)p[i]=i;

	int q;
	scanf("%i",&q);
	for(int i=1;i<=q;i++){
		int h,p;
		scanf("%i %i",&h,&p);
		Qs[h].pb({i,p});
	}

	for(int i=M-1;i>=0;i--){
		for(auto qu:Qs[i]){
			if(z[qu.second]<=i){
				ans[qu.first]=-1;
			}else{
				int x=Find(myFace[qu.second]);
				ans[qu.first]=coef[x][0]+coef[x][1]*i+coef[x][2]*i*i;
			}
		}

		for(auto e:Edge[i]){
			Union(e.first,e.second);
		}
		for(auto f:Formula[i]){
			//printf("%i: Add %i formula %lf %lf %lf\n",i,f.first,f.second[0],f.second[1],f.second[2]);
			int x=Find(f.first);
			for(int j=0;j<3;j++){
				coef[x][j]+=f.second[j];
			}
		}
	}

	for(int i=1;i<=q;i++)printf("%.12lf\n",ans[i]);
	return 0;
}