#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("q.gir","r",stdin);
// freopen("q.cik","w",stdout);
int n;
cin >> n;
vector<int> H(n + 1);
vector<int> A(n + 1);
vector<int> B(n+ 1);
for(int i = 1; i <= n; i++){
cin >> H[i] >> A[i] >> B[i];
}
int q;
cin >> q;
while(q--){
int l, r, ans = -1;
cin >> l >> r;
set<int> S[n + 1];
for(int i = l; i <= r; i++){
for(int j = max(1ll, i - B[i]); j <= max(0ll, i - A[i]); j++){
if(j < l || r < j)continue;
if(S[j].count(i)) ans = max(ans, abs(H[i] - H[j]));
S[i].insert(j);
}
for(int j = min(n + 1, i + A[i]); j <= min(n, i + B[i]); j++){
if(j < l || r < j)continue;
if(S[j].count(i)) ans = max(ans, abs(H[i] - H[j]));
S[i].insert(j);
}
}
cout << ans << "\n";
}
}
