#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;
#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()
cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;
template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;
cl N = 2e5 + 7;
struct segtree {
ll l, r, mx, mn, Cmx, Cmn, ans;
segtree *lt, *rt;
inline segtree (cl &L = 1, cl &R = N - 2) : l(L), r(R), mx(-inf), Cmx(-inf), mn(inf), Cmn(inf), ans(-1) {}
void build () {
if (l == r) return;
lt = new segtree (l, mid);
rt = new segtree (mid + 1, r);
lt->build();
rt->build();
}
inline void push (cl &M, cl &m) { Cmn = min(Cmn, m); Cmx = max(Cmx, M); ans = max({ans, mx - Cmn, Cmx - mn}); }
inline void shift () { lt->push(Cmx, Cmn); rt->push(Cmx, Cmn); Cmx = -inf; Cmn = inf; }
void toggle (cl &pos, cl &x) {
if (l == r) {
Cmx = -inf, Cmn = inf;
if (mn != x) mn = mx = x;
else mn = inf, mx = -inf;
return;
}
shift();
if (pos <= lt->r) lt->toggle(pos, x);
else rt->toggle(pos, x);
mx = max(lt->mx, rt->mx); mn = min(lt->mn, rt->mn); ans = max(lt->ans, rt->ans);
}
void upd (cl &ql, cl &qr, cl &x) {
if (r < ql || qr < l) return;
if (ql <= l && r <= qr) {
push(x, x);
return;
}
shift();
lt->upd(ql, qr, x);
rt->upd(ql, qr, x);
ans = max(lt->ans, rt->ans);
}
ll ask (cl &ql, cl &qr) {
if (r < ql || qr < l) return -1;
if (ql <= l && r <= qr) return ans;
shift();
return max(lt->ask(ql, qr), rt->ask(ql, qr));
}
} seg;
ll h [N], A [N], B [N], ans [N], n, q;
vector <pll> query [N];
vector <ll> vec [N];
int main ()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>> n;
for (ll i = 1; i <= n; i++) {
cin>> h[i] >> A[i] >> B[i];
vec[min(n + 1, i + A[i])].push_back(i); vec[min(n + 1, i + B[i] + 1)].push_back(i);
}
cin>> q;
for (ll i = 1, l, r; i <= q; i++) {
cin>> l >> r;
query[r].push_back({l, i});
}
seg.r = n; seg.build();
for (ll i = 1; i <= n; i++) {
for (auto &x : vec[i]) seg.toggle(x, h[x]);
seg.upd(i - B[i], i - A[i], h[i]);
for (auto [l, id] : query[i]) ans[id] = max(-1, seg.ask(l, i));
}
output(1, q, ans, 0);
cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
/*
5
10 2 4
1 1 1
2 1 3
1 1 1
100 1 1
5
1 2
2 3
1 3
1 4
1 5
20
260055884 2 15
737689751 5 5
575359903 1 15
341907415 14 14
162026576 9 19
55126745 10 19
95712405 11 14
416027186 8 13
370819848 11 14
629309664 4 13
822713895 5 15
390716905 13 17
577166133 8 19
195931195 10 17
377030463 14 17
968486685 11 19
963040581 4 10
566835557 1 12
586336111 6 16
385865831 8 9
1
1 20
*/
