#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include<atcoder/lazysegtree>
#endif
using namespace std;
#define eb emplace_back
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define RDVV(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);vin(__VA_ARGS__)
#define VV(n,...) RDVV(ll,n,__VA_ARGS__)
#define fo(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a)
#define binary_operator(op,type) auto operator op(const type&rhs)const{auto copy=*this;return copy op##=rhs;}
#define defpp template<ostream&o=cout>void pp(const auto&...a){[[maybe_unused]]const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}void epp(const auto&...a){pp<cerr>(a...);}
#define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{
namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto refs(auto&...a){return array{ref(a)...};}
template<class T>constexpr auto for_range(T s,T b){T a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};}
void lin(auto&...a){(cin>>...>>a);}
void vin(auto&...a){fo(i,(a.size()&...))(cin>>...>>a[i]);}
template<class A,class B=A>struct pair{
  A a;B b;
  pair()=default;
  pair(A a,B b):a(a),b(b){}
  auto operator<=>(const pair&)const=default;
  auto&operator+=(const pair&p){a+=p.a;b+=p.b;return*this;}
  binary_operator(+,pair)
};
template<class F=less<>>auto&sort(auto&a,F f={}){ranges::sort(a,f);return a;}
auto&unique(auto&a){sort(a).erase(ranges::unique(a).begin(),a.end());return a;}
template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;
}
namespace my{
template<class T>class FenwickTree{
public:
  ll n_;
  vector<T>data_;
  FenwickTree(const vector<T>&a):n_(a.size()),data_(n_){fo(i,n_)add(i,a[i]);}
  void add(ll i,T x){
    assert(0<=i&&i<n_);
    i++;
    while(i<=n_){
      data_[i-1]+=x;
      i+=i&-i;
    }
  }
  void set(ll i,T x){add(i,x-get(i));}
  T sum(ll l,ll r)const{
    assert(0<=l&&l<=r&&r<=n_);
    T res=0;
    while(r>0)res+=data_[r-1],r-=r&-r;
    while(l>0)res-=data_[l-1],l-=l&-l;
    return res;
  }
  T get(ll i)const{assert(0<=i&&i<n_);return sum(i,i+1);}
};
}
namespace my{
template<class V>constexpr int depth=0;
template<class T>struct core_t_helper{using type=T;};
template<class T>using core_t=core_t_helper<T>::type;
template<class V>struct vec;
template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int D,class T>using hvec=hvec_helper<D,T>::type;
template<class V>struct vec:vector<V>{
  static constexpr int D=depth<V>+1;
  using C=core_t<V>;
  using vector<V>::vector;
  void resizes(const auto&...a){if constexpr(sizeof...(a)==D)*this=make(a...,C{});else{ }}
  static auto make(ll n,const auto&...a){
    if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]);
    else { }
  }
  auto&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}
  auto&operator+=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]+=u[i];return v;}
  binary_operator(^,vec)
  binary_operator(+,vec)
  vec&operator--(){fe(*this,e)--e;return*this;}
  ll size()const{return vector<V>::size();}
  auto&emplace_back(auto&&...a){vector<V>::emplace_back(std::forward<decltype(a)>(a)...);return*this;}
  auto pop_back(){auto r=this->back();vector<V>::pop_back();return r;}
  auto lower_bound(const V&x)const{return std::lower_bound(this->begin(),this->end(),x);}
  ll arg_lower_bound(const V&x)const{return lower_bound(x)-this->begin();}
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
auto zip(auto&...a){auto v=(a^...);unique(v);([&](auto&u){fe(u,e)e=v.arg_lower_bound(e);}(a),...);return v;}
}
namespace my{
template<class M>using LazySegTreeMonoidAlias=atcoder::lazy_segtree<typename M::S,M::op,M::e,typename M::F,M::mapping,M::composition,M::id>;
template<class T>T identity(){return T{};}
template<class T>struct add_sum_node{
  using S=pair<T,ll>;
  using F=T;
  static S op(S a,S b){return a+b;}
  static S e(){return{0,0};}
  static S mapping(F f,S x){return{x.a+f*x.b,x.b};}
  static F composition(F f,F g){return f+g;}
  static F id(){return 0;}
};
template<class T>class LazySegAddSum:public LazySegTreeMonoidAlias<add_sum_node<T>>{
public:
  using S=pair<T,ll>;
  using base=LazySegTreeMonoidAlias<add_sum_node<T>>;
  LazySegAddSum(ll n):base(vec<S>(n,{identity<T>(),1})){}
};
}
namespace my{entry
void main(){
  LL(N);
  VV(N,a,t);--t;
  LL(Q);
  VV(Q,d,l,r);--l;
  auto z=a+t; // z[i]:iが0になる日

  d.eb(0);
  auto X=zip(t,z,d);
  d.pop_back();
  ll D=X.size();
  vec<vec<ll>>event(D),query(D);

  fo(i,N){
    event[t[i]].eb(i);
    event[z[i]].eb(~i);
  }
  fo(q,Q)query[d[q]].eb(q);

  vec<ll>res(Q);
  FenwickTree<ll>no_dec(a);
  LazySegAddSum<ll>dec(N);
  fo(i,N)dec.set(i,{0,0});

  fo(x,D){
    // X[x]日目の昼
    if(x)dec.apply(0,N,-(X[x]-X[x-1])); // 前回からX[x]-X[x-1]日経過している
    fe(event[x],i){
      if(i>=0){ // iを有効にする
        no_dec.set(i,0);
        dec.set(i,{a[i],1});
      }
      else{ // iを無効にする
        dec.set(~i,{0,0});
      }
    }

    // X[x]日目の夜
    fe(query[x],q)res[q]=no_dec.sum(l[q],r[q])+dec.prod(l[q],r[q]).a;
  }

  fe(res,e)pp(e);
}}