#include <bits/stdc++.h>
using namespace std;
int main() {
  int trash;
  int n;
  trash = scanf("%d", &n);
  int a[n];
  int oneDiff[n];
  int diffCount = 0;
  trash = scanf("%d", &a[0]);
  for (int i = 1; i < n; i++) {
    trash = scanf("%d", &a[i]);
    if (a[i] - a[i - 1] == 1) {
      oneDiff[diffCount] = a[i - 1];
      diffCount++;
    }
  }
  sort(oneDiff, oneDiff + diffCount);
  int b;
  int v = 0;
  for (int i = 0; i < n; i++) {
    trash = scanf("%d", &b);
    v += b;
  }
  int c;
  int diffUp = 0;
  for (int i = 0; i < n - 1; i++) {
    trash = scanf("%d", &c);
    if (i == oneDiff[diffUp] - 1) {
      v += c;
      diffUp++;
    }
  }
  printf("%d\n", v);
  return 0;
}
