#include <bits/stdc++.h>
#define time() cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n"
#define fi first
#define se second
#define pb push_back
#define FOR(i, a, b) for (int i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for (int i = a, _b = b; i >= _b; --i)
#define FORLL(i, a, b) for (ll i = a, _b = b; i <= _b; ++i)
#define FORDLL(i, a, b) for (ll i = a, _b = b; i >= _b; --i)
#define all(x) x.begin(), x.end()
#define uni(x) sort(all(x)), x.erase(unique(all(x)), x.end())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__)
template<typename T>
void __print_one(const char *&s, const T &x)
{
while (*s == ' ') ++s;
const char *p = s;
int bal = 0;
while (*s)
{
if (*s == '(') ++bal;
else if (*s == ')') --bal;
else if (*s == ',' && bal == 0) break;
++s;
}
cerr.write(p, s - p) << " = " << x;
if (*s == ',')
{
cerr << " , ";
++s;
}
}
template<typename... Args>
void debug(const char *s, Args... args)
{
cerr << "[ ";
int dummy[] = { 0 , (__print_one(s, args), 0)... };
(void)dummy;
cerr << " ]\n\n";
}
template<class X>
bool maximize(X &a, X b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template<class X>
bool minimize(X &a, X b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
// -----------------------------------------------------------------
const int maxn = 2e5 + 3;
int n, q, H[maxn], A[maxn], B[maxn];
// -----------------------------------------------------------------
namespace sub12
{
bool lienlac(int x, int y)
{
if (x > y) swap(x, y);
return x >= y - B[y] && x <= y - A[y] && y >= x + A[x] && y <= x + B[x];
}
int maxVal[maxn], dp[5003][5003];
bool approve()
{
return n <= 4000;
}
void solve()
{
FOR(i, 1, n)
maxVal[i] = -1e9;
FOR(i, 1, n)
{
FORD(j, i - A[i], max(1, i - B[i]))
{
if (lienlac(j, i)) maxVal[j] = max(maxVal[j], abs(H[i] - H[j]));
}
dp[i][i] = -1e9;
FORD(j, i - 1, 1)
{
dp[j][i] = -1e9;
dp[j][i] = max(dp[j + 1][i], maxVal[j]);
}
}
while (q--)
{
int l, r; cin >> l >> r;
if (l > r)
{
cout << "-1\n";
continue;
}
if (dp[l][r] == -1e9) cout << "-1\n";
else cout << dp[l][r] << '\n';
}
}
}
namespace AC
{
struct Node
{
ll maE, miE;
ll lzmaH, lzmiH;
ll res;
Node()
{
maE = -1e18; miE = 1e18;
res = -1e18;
lzmaH = -1e18;
lzmiH = 1e18;
}
};
Node seg[maxn << 2];
vector<int> Add[maxn], Del[maxn];
vector<pii> qrs[maxn];
ll ans[maxn];
Node combine(Node a, Node b)
{
Node c;
c.maE = max(a.maE, b.maE);
c.miE = min(a.miE, b.miE);
c.res = max(a.res, b.res);
return c;
}
void apply(int id, ll H)
{
seg[id].lzmaH = max(seg[id].lzmaH, H);
seg[id].lzmiH = min(seg[id].lzmiH, H);
seg[id].res = max({seg[id].res, H - seg[id].miE, seg[id].maE - H});
}
void push(int id)
{
if (seg[id].lzmaH != ll(-1e18))
{
apply(id << 1, seg[id].lzmaH);
apply(id << 1 | 1, seg[id].lzmaH);
seg[id].lzmaH = ll(-1e18);
}
if (seg[id].lzmiH != ll(1e18))
{
apply(id << 1, seg[id].lzmiH);
apply(id << 1 | 1, seg[id].lzmiH);
seg[id].lzmiH = ll(1e18);
}
}
void updVal(int id, int l, int r, int pos, ll val)
{
if (l == r)
{
if (val == ll(-1e18))
{
seg[id].maE = ll(-1e18);
seg[id].miE = ll(1e18);
}
else
{
seg[id] = Node();
seg[id].maE = seg[id].miE = val;
}
return;
}
int mid = l + r >> 1;
push(id);
if (pos <= mid) updVal(id << 1, l, mid, pos, val);
else updVal(id << 1 | 1, mid + 1, r, pos, val);
seg[id] = combine(seg[id << 1], seg[id << 1 | 1]);
}
void updH(int id, int l, int r, int u, int v, ll h)
{
if (l > v || r < u) return;
if (l >= u && r <= v) return apply(id, h), void();
int mid = l + r >> 1;
push(id);
updH(id << 1, l, mid, u, v, h); updH(id << 1 | 1, mid + 1, r, u, v, h);
seg[id] = combine(seg[id << 1], seg[id << 1 | 1]);
}
Node get(int id, int l, int r, int u, int v)
{
if (l > v || r < u) return Node();
if (l >= u && r <= v)
{
return seg[id];
}
int mid = l + r >> 1;
push(id);
return combine(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
}
void solve()
{
FOR(i, 1, n)
{
if (i + A[i] <= n)
{
Add[i + A[i]].push_back(i);
}
if (i + B[i] < n)
{
Del[i + B[i]].push_back(i);
}
}
FOR(iq, 1, q)
{
int l, r; cin >> l >> r;
qrs[r].push_back({l, iq});
}
// Nho sua
FOR(r, 1, n)
{
for (int x : Add[r])
{
updVal(1, 1, n, x, H[x]);
}
if (r - A[r] >= 1)
{
updH(1, 1, n, max(1, r - B[r]), r - A[r], H[r]);
}
for (auto &p : qrs[r])
{
int l = p.fi, id = p.se;
Node cur = get(1, 1, n, l, r);
ans[id] = cur.res;
}
for (int x : Del[r])
{
updVal(1, 1, n, x, ll(-1e18));
}
}
FOR(iq, 1, q)
{
if (ans[iq] < 0)
cout << "-1\n";
else
cout << ans[iq] << '\n';
}
}
}
void solve()
{
cin >> n;
FOR(i, 1, n)
{
cin >> H[i] >> A[i] >> B[i];
}
cin >> q;
if (sub12 :: approve()) return sub12 :: solve(), void();
AC :: solve();
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define TASK "test"
if (fopen(TASK".INP", "r"))
{
freopen(TASK".INP", "r", stdin);
freopen(TASK".OUT", "w", stdout);
}
solve();
return 0;
}
