#include <bits/stdc++.h>
using namespace std;
long long int n, a[100100], k[100100], tree[400100], x, q, idx, xx, jj,
    sm[100100], fx;
pair<long long int, long long int> prop[400100];
void init(long long int nd, long long int s, long long int e) {
  if (s == e) {
    tree[nd] = a[s];
    prop[nd] = {-1, -1};
    return;
  }
  long long int mid = s + (e - s) / 2;
  init(2 * nd, s, mid);
  init(2 * nd + 1, mid + 1, e);
  tree[nd] = tree[2 * nd] + tree[2 * nd + 1];
  prop[nd] = {-1, -1};
}
long long int sum(long long int nd, long long int s, long long int e,
                  long long int p, long long int q) {
  if (p > e || q < s) return 0;
  if (p <= s && e <= q) return tree[nd];
  if (prop[nd].second != -1) {
    long long int l = max(s, p), r = min(e, q);
    return (r - l + 1) * (prop[nd].first - k[prop[nd].second - 1]) + sm[r - 1] -
           sm[max(l - 2, (long long int)0)];
  }
  long long int mid = s + (e - s) / 2;
  return sum(2 * nd, s, mid, p, q) + sum(2 * nd + 1, mid + 1, e, p, q);
}
long long int bsrch(long long int s, long long int e, long long int fx,
                    long long int i) {
  if (s == e) return s;
  long long int mid = s + (e - s) / 2, kk;
  if (fx + k[mid - 1] - k[i - 1] > sum(1, 1, n, mid, mid))
    return bsrch(mid + 1, e, fx, i);
  return bsrch(s, mid, fx, i);
}
void updt(long long int nd, long long int s, long long int e, long long int p,
          long long int q, long long int fx, long long int idx) {
  if (p > e || q < s) {
    long long int pr = nd / 2;
    while (pr) {
      if (prop[pr].second != -1) {
        prop[nd] = prop[pr];
        tree[nd] = (e - s + 1) * (prop[nd].first - k[prop[nd].second - 1]) +
                   sm[e - 1] - sm[max(s - 2, (long long int)0)];
      }
      pr /= 2;
    }
    return;
  }
  if (p <= s && e <= q) {
    prop[nd] = {fx, idx};
    tree[nd] = (e - s + 1) * (prop[nd].first - k[prop[nd].second - 1]) +
               sm[e - 1] - sm[max(s - 2, (long long int)0)];
    return;
  }
  long long int mid = s + (e - s) / 2;
  updt(2 * nd, s, mid, p, q, fx, idx);
  updt(2 * nd + 1, mid + 1, e, p, q, fx, idx);
  tree[nd] = tree[2 * nd] + tree[2 * nd + 1];
  prop[nd] = {-1, -1};
}
bool __getchar() {
  long long int ret = getchar();
  if (ret == '+') return 1;
  if (ret == 's') return 0;
  return __getchar();
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i < n; i++) {
    cin >> x;
    k[i] = x + k[i - 1];
    sm[i] = k[i] + sm[i - 1];
  }
  init(1, 1, n);
  cin >> q;
  for (int i = 0; i < q; i++) {
    if (__getchar()) {
      scanf("%lld%lld", &idx, &xx);
      fx = sum(1, 1, n, idx, idx) + xx;
      jj = bsrch(idx, n + 1, fx, idx);
      updt(1, 1, n, idx, jj - 1, fx, idx);
    } else {
      scanf("%lld%lld", &idx, &xx);
      printf("%lld\n", sum(1, 1, n, idx, xx));
    }
  }
  return 0;
}
