#include <bits/stdc++.h>
using namespace std;
long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return f * x;
}
int n, a[200003], k[200003], q;
long long t[200003], b[200003], sumt[200003];
struct TREE {
  long long mx, sum, add;
} tr[200003 * 8];
void pushdown(int x, int len) {
  int l = x << 1, r = x << 1 | 1, lenr = len >> 1, lenl = len - lenr;
  if (tr[x].add != -1e18) {
    long long k = tr[x].add;
    tr[x].add = -1e18;
    tr[l].add = tr[l].mx = k;
    tr[l].sum = k * lenl;
    tr[r].add = tr[r].mx = k;
    tr[r].sum = k * lenr;
  }
}
void pushup(int x) {
  int l = x << 1, r = x << 1 | 1;
  tr[x].mx = max(tr[l].mx, tr[r].mx);
  tr[x].sum = tr[l].sum + tr[r].sum;
}
int find(int rt, int l, int r, long long k) {
  if (k >= tr[rt].mx && rt == 1) return n + 1;
  if (l == r) return l;
  int mid = l + r >> 1;
  pushdown(rt, r - l + 1);
  if (tr[rt << 1].mx > k) return find(rt << 1, l, mid, k);
  return find(rt << 1 | 1, mid + 1, r, k);
}
void change(int rt, int l, int r, int first, int end, long long k) {
  if (first <= l && r <= end) {
    tr[rt].mx = tr[rt].add = k;
    tr[rt].sum = (r - l + 1) * k;
    return;
  }
  int mid = l + r >> 1;
  pushdown(rt, r - l + 1);
  if (first <= mid) change(rt << 1, l, mid, first, end, k);
  if (end > mid) change(rt << 1 | 1, mid + 1, r, first, end, k);
  pushup(rt);
}
void build(int rt, int l, int r) {
  tr[rt].add = -1e18;
  if (l == r) {
    tr[rt].mx = tr[rt].sum = b[l];
    return;
  }
  int mid = l + r >> 1;
  build(rt << 1, l, mid);
  build(rt << 1 | 1, mid + 1, r);
  pushup(rt);
}
long long query(int rt, int l, int r, int first, int end) {
  if (first <= l && r <= end) return tr[rt].sum;
  int mid = l + r >> 1;
  long long ans = 0;
  pushdown(rt, r - l + 1);
  if (first <= mid) ans += query(rt << 1, l, mid, first, end);
  if (end > mid) ans += query(rt << 1 | 1, mid + 1, r, first, end);
  return ans;
}
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  for (int i = 1; i < n; ++i) k[i] = read(), t[i] = t[i - 1] + k[i - 1];
  t[n] = t[n - 1] + k[n - 1];
  for (int i = 1; i <= n; ++i) sumt[i] = sumt[i - 1] + t[i], b[i] = a[i] - t[i];
  build(1, 1, n);
  char c[2];
  q = read();
  int x, y;
  while (q--) {
    cin >> c;
    x = read(), y = read();
    if (c[0] == 's')
      cout << query(1, 1, n, x, y) + sumt[y] - sumt[x - 1] << '\n';
    else {
      long long now = query(1, 1, n, x, x);
      change(1, 1, n, x, find(1, 1, n, now + y) - 1, now + y);
    }
  }
  return 0;
}
