/*
* @Author: MaxPhast
* @File: test.cpp
* @Date: 2025-11-15 02:28:55
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int , int>
#define iii pair <int , ii>
#define iiii pair <ii , ii>
#define FOR(i , l , r) for(int i = (l) , _r = (r) ; i <= _r ; ++ i)
#define FORD(i , r , l) for(int i = (r) , _l = (l) ; i >= _l ; -- i)
#define ALL(vec) vec.begin() , vec.end()
#define UNI(vec) sort(ALL(vec)) , vec.erase(unique(ALL(vec)) , vec.end())
#define pb push_back
#define MASK(i) (1ll << i)
#define BIT(mask , i) ((mask >> i) & 1ll)
#define ON(mask , i) (mask | MASK(i))
#define OFF(mask , i) (mask & (~MASK(i)))
#define TURN(mask , i) (mask ^ MASK(i))
#define BP(mask) __builtin_popcountll(mask)
#define sqr(x) (1ll * (x) * (x))
#define fi first
#define se second
#define oo 1e18
#define time() cerr << " \n " << "Time : " << 1000.0 * clock() / CLOCKS_PER_SEC << "ms."
#define IO(TASK) if(fopen(#TASK".INP" , "r")){freopen(#TASK".INP" , "r" , stdin); freopen(#TASK".OUT" , "w" , stdout);}
template <class X , class Y>
bool maxz(X &a , const Y b)
{
if(a < b)
{
a = b;
return true;
}
return false;
}
template <class X , class Y>
bool minz(X &a , const Y b)
{
if(a > b)
{
a = b;
return true;
}
return false;
}
namespace MaxPhast
{
const int N = 2e5 + 5;
int n , q;
int h[N] , a[N] , b[N] , it[N << 2] , ans[N];
vector <int> even[N];
vector <ii> query[N];
set <int> myset;
void up(int id , int l , int r , int pos , int val)
{
if(pos < l || pos > r)
return;
if(l == r)
{
maxz(it[id] , abs(val - h[l]));
return;
}
int mid = l + r >> 1;
up(id << 1 , l , mid , pos , val);
up(id << 1 | 1 , mid + 1 , r , pos , val);
it[id] = max(it[id << 1] , it[id << 1 | 1]);
}
int get(int id , int l , int r , int u , int v)
{
if(l > v || r < u)
return -1;
if(l >= u && r <= v)
return it[id];
int mid = l + r >> 1;
return max(get(id << 1 , l , mid , u , v) ,
get(id << 1 | 1 , mid + 1 , r , u , v));
}
void solve()
{
cin >> n;
FOR(i , 1 , n)
cin >> h[i] >> a[i] >> b[i];
cin >> q;
FOR(i , 1 , q)
{
int l , r; cin >> l >> r;
query[r].pb({l , i});
}
FOR(i , 1 , n)
{
int l = min(n , i + a[i]) , r = min(n , i + b[i]);
even[l].pb(i);
even[r + 1].pb(-i);
}
memset(it , -1 , sizeof(it));
FOR(i , 1 , n)
{
for(int &x : even[i])
{
if(x > 0)
myset.insert(x);
else
myset.erase(-x);
}
for(auto &x : myset)
{
if(x >= i - b[i] && x <= i - a[i])
up(1 , 1 , n , x , h[i]);
}
for(ii &it : query[i])
ans[it.se] = get(1 , 1 , n , it.fi , i);
}
FOR(i , 1 , q)
cout << ans[i] << "\n";
}
}
signed main()
{
ios_base :: sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
IO(test);
MaxPhast :: solve();
time();
}
/*
*/
