#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> void chmax(T& x, U y){if(x<y) x=y;}
template<class T,class U> void chmin(T& x, U y){if(y<x) x=y;}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

struct MinCostFlow{
	using C = ll;		// capacity
	using D = ll;		// cost (distance)
	const D inf = 1e18;	// max distance

	struct edge{
		int to;
		C cap;
		D cost;
		int rev;
		edge(int to_,C cap_, D cost_, int rev_):to(to_),cap(cap_),cost(cost_),rev(rev_){}
	};
	
	int N;
	VV<edge> G;
	V<D> h;
	V<D> dist;
	V<int> prevv,preve;
	MinCostFlow(int N_):N(N_){
		G.resize(N);
		h.resize(N);
		dist.resize(N);
		prevv.resize(N);
		preve.resize(N);
	}

	void add_edge(int from, int to, C cap, D cost){
		shows("add_edge",from,to,cap,cost);
		edge e1(to,cap,cost,(int)G[to].size());
		edge e2(from,0,-cost,(int)G[from].size());
		G[from].push_back(e1);
		G[to].push_back(e2);
	}
	D min_cost_flow(int s, int t, C f){
		D res = 0;
		h = V<D>(N);
		while(f > 0){
			using P = pair<D,int>;
			priority_queue< P,vector<P>,greater<P> > que;
			dist = V<D>(N,inf);
			dist[s] = 0;
			que.push(P(0,s));
			while(!que.empty()){
				P p = que.top();
				que.pop();
				int v = p.second;
				if(dist[v] < p.first) continue;
				for(int i=0;i<(int)G[v].size();i++){
					edge &e = G[v][i];
					if(e.cap>0 && dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){
						dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];
						prevv[e.to]=v;
						preve[e.to]=i;
						que.push(P(dist[e.to],e.to));
					}
				}
			}
			if(dist[t]==inf) return -1;
			rep(v,N) h[v]+=dist[v];
			C d = f;
			for(int v=t;v!=s;v=prevv[v]){
				chmin(d,G[prevv[v]][preve[v]].cap);
			}
			f -= d;
			res += d*h[t];
			for(int v=t;v!=s;v=prevv[v]){
				edge &e=G[prevv[v]][preve[v]];
				e.cap-=d;
				G[v][e.rev].cap+=d;
			}
		}
		return res;
	}

	/*
		流量を横軸に、コストを縦軸に取ったときのグラフ
		各線分の (dx,dy/dx) の vector を返す
		CF621 G 
	*/
	V<pair<C,D>> min_cost_flow_slopes(int s, int t){		// {(x,tan)}
		V<pair<C,D>> res;
		h = V<D>(N);
		while(true){
			using P = pair<D,int>;
			priority_queue< P,vector<P>,greater<P> > que;
			dist = V<D>(N,inf);
			dist[s] = 0;
			que.push(P(0,s));
			while(!que.empty()){
				P p = que.top();
				que.pop();
				int v = p.second;
				if(dist[v] < p.first) continue;
				for(int i=0;i<(int)G[v].size();i++){
					edge &e = G[v][i];
					if(e.cap>0 && dist[e.to]>dist[v]+e.cost+h[v]-h[e.to]){
						dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];
						prevv[e.to]=v;
						preve[e.to]=i;
						que.push(P(dist[e.to],e.to));
					}
				}
			}
			if(dist[t]==inf) break;
			rep(v,N) h[v]+=dist[v];
			C f = inf;
			for(int v=t;v!=s;v=prevv[v]){
				chmin(f,G[prevv[v]][preve[v]].cap);
			}
			res.pb(f,h[t]);				// x, tan
			for(int v=t;v!=s;v=prevv[v]){
				edge &e=G[prevv[v]][preve[v]];
				e.cap-=f;
				G[v][e.rev].cap+=f;
			}
			if(f >= TEN(17)) break;
		}
		return res;
	}
};


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N; cin >> N;
	V<int> K(N);
	VV<ll> S(N),P(N),C(N);
	rep(i,N){
		cin >> K[i];
		S[i] = P[i] = C[i] = V<ll>(K[i]);
		rep(j,K[i]){
			cin >> S[i][j] >> P[i][j] >> C[i][j];
		}
		rep(_,K[i]-1) rep(p,K[i]-1){
			if(S[i][p] > S[i][p+1]){
				swap(S[i][p],S[i][p+1]);
				swap(P[i][p],P[i][p+1]);
				swap(C[i][p],C[i][p+1]);
			}
		}
	}

	VV<int> idx(N);
	int Vnum = 2, SS = 0, TT = 1;
	{
		rep(i,N){
			rep(j,K[i]+1){
				idx[i].pb(Vnum++);
			}
		}
	}

	MinCostFlow MCF(Vnum);

	// c * max(x-y-d,0)
	auto add = [&](int x,int y,ll d,ll c){
		MCF.add_edge(y,x,c,d);
	};
	// x-y <= d
	auto add2 = [&](int x,int y,ll d){
		const ll inf = 1e18;
		add(x,y,d,inf);
	};
	auto addE = [&](int x,int y){
		add2(x,y,0);
		add2(y,x,0);
	};

	rep(i,N){

		rep(j,K[i]){
			add(idx[i][j+1],idx[i][j],0,P[i][j]);
		}
	}
	rep(i,N){
		rep(j,K[i]){
			add2(idx[i][j],idx[i][j+1],0);
			add2(idx[i][j+1],idx[i][j],C[i][j]);
		}
		addE(SS,idx[i][0]);
		addE(TT,idx[i][K[i]]);
	}
	int M; cin >> M;
	rep(_,M){
		int j,i; ll w;
		cin >> j >> i >> w; i--,j--;
		shows(i,j,w);
		// i - j <= w
		rep(a,K[i]) rep(b,K[j]){
			if(S[i][a]-S[j][b] > w){
				add2(idx[j][b+1],idx[i][a],0);
			}
		}
	}
	auto slope = MCF.min_cost_flow_slopes(SS,TT);
	show(slope);
	using pll = pair<ll,ll>;
	{
		int K = slope.size();
		V<pll> v;
		v.pb(0,0);
		rep(i,K){
			ll x = v.back().fs;
			ll y = v.back().sc;
			x += slope[i].fs;
			y += slope[i].fs * slope[i].sc;
			v.pb(x,y);
		}
		show(v);

		int Q; cin >> Q;
		while(Q--){
			ll A; cin >> A;
			if(A > slope.back().sc){
				cout << -1 << endl;
			}else{
				rep(i,K){
					if(slope[i].sc <= A && A <= slope[i+1].sc){
						cout << -(v[i+1].sc - A * v[i+1].fs) << endl;
						break;
					}
				}
			}
		}
	}

}


Measured memory_bytes: 3788