#include <bits/stdc++.h>

#define vi vector<int>
#define vvi vector<vi>
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define ii pair<int, int>
#define vii vector<ii>
#define vvii vector<vii>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end())
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (ll) a / __gcd(a, b) * b
#define prt(u, v) \
    for (auto x = u; x != v;) cout << (*x) << " \n"[++x == v];

using namespace std;

void print();
template <typename T, typename... Args>
void print(T x, Args... args);

typedef vector<double> vd;

void apply(vd &a, vd &b, int p) {
    double u = a[p];
    double v = a[p + 1];
    a[p] = min(u, (u + v - b[p]) / 2);
    a[p + 1] = max(v, (u + v + b[p]) / 2);
}
void test() {
    vd a = {100, 2, 30};
    vd b = {0, 0};

    prt(a.begin(), a.end());
    prt(b.begin(), b.end());

    srand(time(NULL));
    for (int i = 0; i < 10000; ++i) apply(a, b, rand() % 2);

    prt(a.begin(), a.end());
}
void solve() {
    const int M = 1e9 + 7;
    int n;
    cin >> n;
    vi c(n), b(n - 1);
    for (int i = 0; i < n; ++i) cin >> c[i];
    for (int i = 0; i < n - 1; ++i) cin >> b[i];

    int q;
    cin >> q;
    vi x(q);
    for (int i = 0; i < q; ++i) cin >> x[i];

    vi a(n);
    a[0] = x[0];
    for (int i = 0; i < n - 1; ++i) a[i + 1] = a[i] + b[i];
    partial_sum(a.begin(), a.end(), a.begin());

    const int N = 107;
    const int V = N * N;

    vi dp(V), tmp(V);
    dp[0] = 1;
    for (int i = 0; i < n; ++i) {
        copy(dp.begin(), dp.end(), tmp.begin());
        fill(dp.begin(), dp.end(), 0);

        for (int j = 0; j < V; ++j)
            if (tmp[j]) {
                int low = max(a[i], j);
                int hig = max(a[i], j + c[i] + 1);

                if (low < V) dp[low] = (dp[low] + tmp[j]) % M;
                if (hig < V) dp[hig] = (dp[hig] + M - tmp[j]) % M;
            }

        partial_sum(dp.begin(), dp.end(), dp.begin(),
                    [](int u, int v) { return (u + v) % M; });
    }

    print(accumulate(dp.begin(), dp.end(), 0LL,
                     [](int u, int v) { return (u + v) % M; }));
}
int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

    int t = 1;
    // cin >> t;
    for (int i = 0; i++ < t;) solve();
    // test();

    return 0;
}

void print() { cout << "\n"; }
template <typename T, typename... Args>
void print(T x, Args... args) {
    if (sizeof...(args)) {
        cout << x << ' ';
        print(args...);
    } else {
        cout << x << '\n';
    }
}