#include <bits/stdc++.h>
#define ar array
//#define int long long
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 5;
struct segment_tree {
int n;
vector<int> tree, mn, lazy;
segment_tree(int _n) : n(_n), tree(4*n, -2e9), mn(4*n, 2e9), lazy(4*n) {}
void push(int u, int tl, int tr) {
if(!lazy[u]) return ;
tree[u] = max(tree[u], lazy[u] - mn[u]);
if(tl != tr) {
lazy[2*u] = max(lazy[2*u], lazy[u]);
lazy[2*u+1] = max(lazy[2*u+1], lazy[u]);
}
lazy[u] = 0;
}
void set_mn(int u, int tl, int tr, int p, int v) {
if(tl == tr) {
mn[u] = v;
} else {
int tm = (tl + tr) / 2;
if(p <= tm) set_mn(2*u, tl, tm, p, v);
else set_mn(2*u+1, tm+1, tr, p, v);
mn[u] = min(mn[2*u], mn[2*u+1]);
}
}
void set_mx(int u, int tl, int tr, int l, int r, int v) {
push(u, tl, tr);
if(tl > r || l > tr) return ;
if(l <= tl && tr <= r) {
tree[u] = max(tree[u], lazy[u] - mn[u]);
lazy[u] = max(lazy[u], v);
push(u, tl, tr);
return ;
}
int tm = (tl + tr) / 2;
set_mx(2*u, tl, tm, l, r, v);
set_mx(2*u+1, tm+1, tr, l, r, v);
tree[u] = max(tree[2*u], tree[2*u+1]);
}
int query(int u, int tl, int tr, int l, int r) {
if(tl > r || l > tr) return -2e9;
push(u, tl, tr);
if(l <= tl && tr <= r) return tree[u];
int tm = (tl + tr) / 2;
return max(query(2*u, tl, tm, l, r), query(2*u+1, tm+1, tr, l, r));
}
void set_mn(int p, int v) { set_mn(1, 1, n, p, v); }
void set_mx(int l, int r, int v) { set_mx(1, 1, n, l, r, v); }
int query(int l, int r) { return query(1, 1, n, l, r); }
};
signed main() {
ios_base::sync_with_stdio(false);
cout.tie(0); cin.tie(0);
int n; cin >> n;
vector<int> h(n+1), a(n+1), b(n+1);
for(int i=1; i<=n; i++) cin >> h[i] >> a[i] >> b[i];
int q; cin >> q;
vector<pii> qus[n+1];
for(int i=1; i<=q; i++) {
int l, r; cin >> l >> r;
qus[r].push_back({ l, i });
}
vector<int> ans(q+1, -1);
segment_tree sgt(n);
vector<int> in[n+1], out[n+1];
for(int i=1; i<=n; i++) {
int l = min(n, i+a[i]);
int r = min(n, i+b[i]);
in[l].push_back(i);
out[r].push_back(i);
}
for(int i=1; i<=n; i++) {
for(int id : in[i]) sgt.set_mn(id, h[id]);
int l = max(1, i-b[i]);
int r = max(1, i-a[i]);
sgt.set_mx(l, r, h[i]);
for(auto [j, id] : qus[i])
ans[id] = max(ans[id], sgt.query(j, i));
for(int id : out[i]) sgt.set_mn(id, 2e9);
}
for(int i=1; i<=q; i++) cout << ans[i] << '\n';
}
