#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 9223372036854775807
#define MOD 998244353
#define mod 998244353
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll> a,pair<ll,ll> b){
        if(a.se!=b.se)
        return a.se<b.se;
        else
        return a.fi>b.fi;
}
//----------------------------------------------------------------------
int N,M,L;
double B[11],H[11],h[10];
int F[9];
double X[9];
void pour(int x,double& v,int l,int r){
    if(r-l>=2){
        int mx=l+1;
        for(int i=l+1;i<r;i++) if(H[i]>H[mx]) mx=i;
        if(x<mx){
            pour(x,v,l,mx);
            pour(x,v,mx,r);
        }else{
            pour(x,v,mx,r);
            pour(x,v,l,mx);
        }
    }
    double w=B[r]-B[l],u=min(H[l],H[r]);
    double dh=v/w;
    if(h[l]+dh<u){
        v=0;
        for(int i=l;i<r;i++) h[i]+=dh;
    }else{
        v-=(u-h[l])*w;
        for(int i=l;i<r;i++) h[i]=u;
    }
}
//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_t=clock();
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    //-------------------------------
    int Q;
    cin>>Q;
    rep(tt,Q){
        cin>>N;
        rep1(i,N) cin>>B[i]>>H[i];
        N++;
        B[0]=0,B[N]=100;
        H[0]=H[N]=50;
        cin>>M;
        rep(i,M){
            cin>>F[i]>>X[i];
            X[i]/=30;
            F[i]=lower_bound(B,B+N,F[i])-B-1;
        }
        cin>>L;
        rep(i,L){
            rep(j,N) h[j]=0;
            int p,t;
            cin>>p>>t;
            rep(j,M){
                double v=X[j]*t;
                pour(F[j],v,0,N);
            }
            p=lower_bound(B,B+N,p)-B-1;
            printf("%.8f\n",h[p]);
        }
    }
    //-------------------------------  
    //fclose(stdin);
    //fclose(stdout);
    //ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------











































Measured memory_bytes: 3144