#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int s[MAXN], lim[MAXN], reg[MAXN], m, n;
vector<long long> summax[4 * MAXN], sumreg[4 * MAXN];
vector<pair<int, int> > v[4 * MAXN];
set<pair<pair<int, int>, int> > range;
set<pair<pair<int, int>, int> >::iterator it;
void merge(vector<pair<int, int> > &k, vector<pair<int, int> > &l,
           vector<pair<int, int> > &r) {
  int lit = 0, rit = 0;
  k.resize(l.size() + r.size());
  for (int i = 0; i < l.size() + r.size(); ++i)
    if (lit == l.size() || rit == r.size())
      k[i] = (lit == l.size() ? r[rit++] : l[lit++]);
    else if (l[lit] < r[rit])
      k[i] = l[lit++];
    else
      k[i] = r[rit++];
}
void calc(int x, vector<pair<int, int> > &k) {
  summax[x].resize(k.size() + 1);
  sumreg[x].resize(k.size() + 1);
  summax[x][0] = 0;
  sumreg[x][k.size()] = 0;
  for (int i = 1; i < k.size() + 1; ++i)
    summax[x][i] = summax[x][i - 1] + lim[k[i - 1].second];
  for (int i = k.size() - 1; i >= 0; --i)
    sumreg[x][i] = sumreg[x][i + 1] + reg[k[i].second];
}
void build(int x, int l, int r) {
  if (l == r) {
    v[x].push_back(
        make_pair(reg[l] ? (lim[l] + reg[l] - 1) / reg[l] : 1e9 + 9, l));
    calc(x, v[x]);
    return;
  }
  int md = (l + r) / 2;
  build(x * 2, l, md);
  build(x * 2 + 1, md + 1, r);
  merge(v[x], v[x * 2], v[x * 2 + 1]);
  calc(x, v[x]);
}
long long que(int x, int l, int r, int ll, int rr, int time) {
  if (l > rr || r < ll) return 0;
  if (l >= ll && r <= rr) {
    int k = upper_bound(v[x].begin(), v[x].end(), make_pair(time, (int)1e9)) -
            v[x].begin();
    return summax[x][k] + sumreg[x][k] * time;
  }
  int md = (l + r) / 2;
  return que(x * 2, l, md, ll, rr, time) +
         que(x * 2 + 1, md + 1, r, ll, rr, time);
}
void check(set<pair<pair<int, int>, int> >::iterator i, int l, int r) {
  int nl = i->first.second, nr = i->first.first, time = i->second;
  if (nl < l && nr >= l) range.insert(make_pair(make_pair(l - 1, nl), time));
  if (nl <= r && nr > r) range.insert(make_pair(make_pair(nr, r + 1), time));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> s[i] >> lim[i] >> reg[i];
  build(1, 1, n);
  cin >> m;
  range.insert(make_pair(make_pair(n, 1), -1));
  for (int i = 0; i < m; ++i) {
    int t, l, r;
    cin >> t >> l >> r;
    long long ans = 0;
    int lit = l, nl, nr, time;
    while (lit <= r) {
      it = range.lower_bound(make_pair(make_pair(lit, -1), -1));
      check(it, l, r);
      nl = it->first.second;
      nr = it->first.first;
      time = it->second;
      if (time == -1)
        for (; lit <= r && lit <= nr; ++lit)
          ans += min(1LL * lim[lit], 1LL * s[lit] + 1LL * reg[lit] * t);
      else
        ans += que(1, 1, n, lit, min(nr, r), t - time);
      range.erase(it);
      lit = nr + 1;
    }
    range.insert(make_pair(make_pair(r, l), t));
    cout << ans << '\n';
  }
}
