#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
unsigned long long random(unsigned long long l, unsigned long long r) {
return uniform_int_distribution<unsigned long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9 + 69;
const long long INF = 1e18;
int n, q;
int h[N], a[N], b[N], ans[N];
vector<int> events[N];
vii que[N];
struct SegmentTree {
struct Node {
int maxH, minH, maxC, minC, ans;
Node() {
maxH = maxC = -inf;
minH = minC = inf;
ans = -inf;
}
Node operator + (const Node &other) {
Node res;
res.maxH = max(maxH, other.maxH);
res.minH = min(minH, other.minH);
res.ans = max(ans, other.ans);
// res.maxC = max(maxC, other.maxC);
// res.minC = min(minC, other.minC);
return res;
}
};
vector<Node> nodes;
vector<int> lazyMax, lazyMin;
int n;
SegmentTree(int _n = 0) {
resize(_n);
}
void resize(int _n) {
n = _n;
nodes.assign(4 * n + 5, Node());
lazyMax.assign(4 * n + 5, -inf);
lazyMin.assign(4 * n + 5, inf);
}
void apply(int id, int valMax, int valMin) {
maximize(nodes[id].maxC, valMax);
minimize(nodes[id].minC, valMin);
maximize(nodes[id].ans, nodes[id].maxH - nodes[id].minC);
maximize(nodes[id].ans, nodes[id].maxC - nodes[id].minH);
maximize(lazyMax[id], valMax);
minimize(lazyMin[id], valMin);
}
void push(int id) {
if (lazyMax[id] == -inf) return;
apply(id << 1, lazyMax[id], lazyMin[id]);
apply(id << 1 | 1, lazyMax[id], lazyMin[id]);
lazyMax[id] = -inf, lazyMin[id] = inf;
}
void update(int id, int l, int r, int p, int val) {
if (l == r) {
if (val != inf) nodes[id].maxH = nodes[id].minH = val;
else nodes[id].maxH = -inf, nodes[id].minH = inf;
nodes[id].maxC = -inf, nodes[id].minC = inf;
return;
}
push(id); int mid = (l + r) >> 1;
nodes[id].maxC = -inf, nodes[id].minC = inf;
if (p <= mid) update(id << 1, l, mid, p, val);
else update(id << 1 | 1, mid + 1, r, p, val);
nodes[id] = nodes[id << 1] + nodes[id << 1 | 1];
// cerr << id << ' ' << l << ' ' << r << ' ' << nodes[id].ans << '\n';
}
void update(int p, int val) {
update(1, 1, n, p, val);
}
void updateC(int id, int l, int r, int u, int v, int val) {
if (l > v || r < u) return;
// cerr << "update " << id << ' ' << l << ' ' << r << ' ' << nodes[id].maxH << '\n';
if (u <= l && r <= v) {
apply(id, val, val);
// cerr << "id " << nodes[id].ans << '\n';
return;
}
push(id); int mid = (l + r) >> 1;
updateC(id << 1, l, mid, u, v, val);
updateC(id << 1 | 1, mid + 1, r, u, v, val);
nodes[id] = nodes[id << 1] + nodes[id << 1 | 1];
}
void updateC(int u, int v, int val) {
maximize(u, 1);
minimize(v, n);
return updateC(1, 1, n, u, v, val);
}
int get(int id, int l, int r, int u, int v) {
if (l > v || r < u) return -inf;
if (u <= l && r <= v) return nodes[id].ans;
push(id); int mid = (l + r) >> 1;
return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
}
int get(int u, int v) {
maximize(u, 1);
minimize(v, n);
if (u > v) return -inf;
return get(1, 1, n, u, v);
}
};
void addEvent(int p, int type) {
if (p <= n) events[p].emplace_back(type);
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> h[i] >> a[i] >> b[i];
cin >> q;
for (int i = 1; i <= q; ++i) {
int l, r; cin >> l >> r;
que[r].emplace_back(l, i);
ans[i] = -inf;
}
SegmentTree mytree(n);
for (int r = 1; r <= n; ++r) {
for (auto p : events[r]) {
// if (r == 4) {
// cerr << "broccoli = " << p << '\n';
// if (p > 0) continue;
// }
if (p > 0) mytree.update(p, h[p]);
else mytree.update(-p, inf);
}
// cerr << max(1, r - b[r]) << ' ' << r - a[r] << '\n';
mytree.updateC(r - b[r], r - a[r], h[r]);
for (auto [l, id] : que[r]) {
auto tmp = mytree.get(l, r);
ans[id] = tmp;
}
addEvent(r + a[r], r);
addEvent(r + b[r] + 1, -r);
}
for (int i = 1; i <= q; ++i)
cout << (ans[i] < 0 ? -1 : ans[i]) << '\n';
return 0;
}
