#include <bits/stdc++.h>
const long long maxn = 1e5 + 10;
bool tag[maxn << 2];
long long setv[maxn << 2];
long long maxv[maxn << 2];
long long sumv[maxn << 2];
inline void set(long long r, long long L, long long R, long long v) {
  tag[r] = true;
  maxv[r] = setv[r] = v;
  sumv[r] = (R - L + 1) * v;
}
inline void Pushdown(long long r, long long L, long long R) {
  if (tag[r]) {
    long long Mid = (L + R) >> 1;
    set(r << 1, L, Mid, setv[r]);
    set(r << 1 | 1, Mid + 1, R, setv[r]);
    tag[r] = false;
  }
}
void Change(long long r, long long L, long long R, long long Lu, long long Ru,
            long long v) {
  if (L > Ru || R < Lu) return;
  if (L >= Lu && R <= Ru) return set(r, L, R, v), void();
  Pushdown(r, L, R);
  long long Mid = (L + R) >> 1;
  Change(r << 1, L, Mid, Lu, Ru, v);
  Change(r << 1 | 1, Mid + 1, R, Lu, Ru, v);
  sumv[r] = sumv[r << 1] + sumv[r << 1 | 1];
  maxv[r] = std::max(maxv[r << 1], maxv[r << 1 | 1]);
}
long long get(long long r, long long L, long long R, long long Lu,
              long long Ru) {
  if (L > Ru || R < Lu) return LLONG_MIN / 2;
  if (L >= Lu && R <= Ru) return maxv[r];
  Pushdown(r, L, R);
  long long Mid = (L + R) >> 1;
  return std::max(get(r << 1, L, Mid, Lu, Ru),
                  get(r << 1 | 1, Mid + 1, R, Lu, Ru));
}
long long sum(long long r, long long L, long long R, long long Lu,
              long long Ru) {
  if (L > Ru || R < Lu) return 0;
  if (L >= Lu && R <= Ru) return sumv[r];
  Pushdown(r, L, R);
  long long Mid = (L + R) >> 1;
  return sum(r << 1, L, Mid, Lu, Ru) + sum(r << 1 | 1, Mid + 1, R, Lu, Ru);
}
long long n, m;
long long a[maxn];
long long b[maxn];
long long s[maxn];
signed main() {
  std::cin >> n;
  for (long long i = 1; i <= n; i++) std::cin >> a[i];
  for (long long i = 1; i < n; i++) {
    std::cin >> b[i];
    b[i] += b[i - 1];
    s[i] = s[i - 1] + b[i];
  }
  for (long long i = 1; i <= n; i++) Change(1, 1, n, i, i, a[i] - b[i - 1]);
  std::cin >> m;
  for (long long L, R, Mid, x, v, add; m--;) {
    std::string cmd;
    std::cin >> cmd;
    if (cmd == "+") {
      std::cin >> x >> add;
      v = get(1, 1, n, x, x) + b[x - 1];
      L = x, R = n + 1;
      while (R - L > 1) {
        Mid = (L + R) >> 1;
        if (get(1, 1, n, x + 1, Mid) < v + add - b[x - 1])
          L = Mid;
        else
          R = Mid;
      }
      Change(1, 1, n, x, L, v + add - b[x - 1]);
    } else {
      std::cin >> L >> R;
      std::cout << sum(1, 1, n, L, R) + s[R - 1] - (L > 1 ? s[L - 2] : 0)
                << '\n';
    }
  }
  return 0;
}
