#include<stdio.h>
#include<algorithm>
typedef long long ll;
int a[100005],b[100005];
int y[200005];
int s[200005];
struct seg
{
    int x,l;
    operator int(){return x;}
};
seg p[200005];
ll r[200005];
int t[200005];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%*d%d%d",a+i,b+i);
        y[i]=a[i],y[n+i]=b[i];
    }
    std::sort(y+1,y+(n<<1)+1);
    const int m(std::unique(y+1,y+(n<<1)+1)-y-1);
    for(int i=1;i<=n;i++)
    {
        a[i]=std::lower_bound(y+1,y+m+1,a[i])-y;
        b[i]=std::lower_bound(y+1,y+m+1,b[i])-y;
        ++s[a[i]],--s[b[i]];
    }
    for(int i=1;i<m;i++)
    {
        s[i+1]+=s[i];
        p[i]=seg{s[i],y[i+1]-y[i]};
    }
    std::sort(p+1,p+m);
    for(int i=m-1;i>=1;i--)
    {
        r[i]=r[i+1]+(ll)p[i].x*p[i].l;
        t[i]=t[i+1]+p[i].l;
    }
    int q;
    scanf("%d",&q);
    while(q--)
    {
        int l,r;
        scanf("%d%d",&l,&r);
        const int w(l+r+2);
        const int k(std::lower_bound(p+1,p+m,w)-p);
        printf("%lld\n",::r[k]-(ll)w*t[k]);
    }
    return 0;
}