#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const long long inf = -1e18;
int in[N], imp[N];
vector<int> go[N];
long long preK[N];
int a[N], k[N];
bool isFull[N * 4];
long long lazy[N * 4], maxi[N * 4], sum[N * 4], maxiSum[N * 4];
void init(int pos, int l, int r) {
  if (l == r) {
    maxi[pos] = a[l] - preK[l - 1];
    maxiSum[pos] = maxi[pos];
    sum[pos] = a[l];
    return;
  }
  int mid = (l + r) / 2;
  init(pos * 2, l, mid);
  init(pos * 2 + 1, mid + 1, r);
  sum[pos] = sum[pos * 2] + sum[pos * 2 + 1];
  maxiSum[pos] = maxiSum[pos * 2] + maxiSum[pos * 2 + 1];
  maxi[pos] = max(maxi[pos * 2], maxi[pos * 2 + 1]);
}
void push(int pos, int l, int r) {
  if (isFull[pos]) {
    maxi[pos] = lazy[pos];
    sum[pos] -= maxiSum[pos];
    maxiSum[pos] = lazy[pos] * (r - l + 1);
    sum[pos] += maxiSum[pos];
    if (l != r) {
      isFull[pos * 2] = 1;
      lazy[pos * 2] = lazy[pos];
      isFull[pos * 2 + 1] = 1;
      lazy[pos * 2 + 1] = lazy[pos];
    }
    isFull[pos] = 0;
  }
}
void updateElement(int pos, int l, int r, int ind, long long val) {
  push(pos, l, r);
  if (l == r) {
    sum[pos] += val;
    maxi[pos] += val;
    maxiSum[pos] += val;
    return;
  }
  int mid = (l + r) / 2;
  if (ind <= mid) {
    updateElement(pos * 2, l, mid, ind, val);
  } else {
    updateElement(pos * 2 + 1, mid + 1, r, ind, val);
  }
  sum[pos] = sum[pos * 2] + sum[pos * 2 + 1];
  maxiSum[pos] = maxiSum[pos * 2] + maxiSum[pos * 2 + 1];
  maxi[pos] = max(maxi[pos * 2], maxi[pos * 2 + 1]);
}
void update(int pos, int l, int r, int ql, int qr, long long v) {
  push(pos, l, r);
  if (r < ql || qr < l) {
    return;
  }
  if (ql <= l && r <= qr) {
    isFull[pos] = true;
    lazy[pos] = v;
    push(pos, l, r);
    return;
  }
  int mid = (l + r) / 2;
  update(pos * 2, l, mid, ql, qr, v);
  update(pos * 2 + 1, mid + 1, r, ql, qr, v);
  sum[pos] = sum[pos * 2] + sum[pos * 2 + 1];
  maxiSum[pos] = maxiSum[pos * 2] + maxiSum[pos * 2 + 1];
  maxi[pos] = max(maxi[pos * 2], maxi[pos * 2 + 1]);
}
long long getSum(int pos, int l, int r, int ql, int qr) {
  push(pos, l, r);
  if (r < ql || qr < l) {
    return 0;
  }
  if (ql <= l && r <= qr) {
    return sum[pos];
  }
  int mid = (l + r) / 2;
  return getSum(pos * 2, l, mid, ql, qr) +
         getSum(pos * 2 + 1, mid + 1, r, ql, qr);
}
long long getMaxi(int pos, int l, int r, int ql, int qr) {
  push(pos, l, r);
  if (r < ql || qr < l) {
    return inf;
  }
  if (ql <= l && r <= qr) {
    return maxi[pos];
  }
  int mid = (l + r) / 2;
  return max(getMaxi(pos * 2, l, mid, ql, qr),
             getMaxi(pos * 2 + 1, mid + 1, r, ql, qr));
}
void solve() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= n - 1; ++i) {
    scanf("%d", &k[i]);
    preK[i] = preK[i - 1] + k[i];
  }
  init(1, 1, n);
  int q;
  scanf("%d", &q);
  char s;
  int l, r;
  int g = 0;
  while (q--) {
    ++g;
    scanf(" %c %d %d ", &s, &l, &r);
    if (s == 's') {
      printf("%lld\n", getSum(1, 1, n, l, r));
    } else {
      long long u = getMaxi(1, 1, n, l, l) + r;
      update(1, 1, n, l, l, u);
      int maxi = l;
      if (l + 1 <= n) {
        long long v = getMaxi(1, 1, n, l + 1, l + 1);
        if (v < u) {
          int x = l + 1, y = n + 1, mid;
          while (x < y) {
            mid = (x + y) / 2;
            long long g = getMaxi(1, 1, n, l + 1, mid);
            if (u <= g) {
              y = mid;
            } else {
              x = mid + 1;
            }
          }
          maxi = x - 1;
          update(1, 1, n, l + 1, x - 1, u);
        }
      }
    }
  }
}
int main() { solve(); }
