Problem:
 Score : 200 points    Problem Statement Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1 , Dish 2 , \ldots , Dish N ) once.  The i -th dish (1 \leq i \leq N) he ate was Dish A_i .  When he eats Dish i  (1 \leq i \leq N) , he gains B_i satisfaction points.  Additionally, when he eats Dish i+1 just after eating Dish i  (1 \leq i \leq N - 1) , he gains C_i more satisfaction points.  Find the sum of the satisfaction points he gained.      Constraints  All values in input are integers.  2 \leq N \leq 20  1 \leq A_i \leq N  A_1, A_2, ..., A_N are all different.  1 \leq B_i \leq 50  1 \leq C_i \leq 50         Input Input is given from Standard Input in the following format:  N  A_1  A_2  ...  A_N  B_1  B_2  ...  B_N  C_1  C_2  ...  C_{N-1}       Output Print the sum of the satisfaction points Takahashi gained, as an integer.        Sample Input 1 3
3 1 2
2 5 4
3 6      Sample Output 1 14  Takahashi gained 14 satisfaction points in total, as follows:   First, he ate Dish 3 and gained 4 satisfaction points.  Next, he ate Dish 1 and gained 2 satisfaction points.  Lastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.        Sample Input 2 4
2 3 4 1
13 5 8 24
45 9 15      Sample Output 2 74       Sample Input 3 2
1 2
50 50
50      Sample Output 3 150

Solution (Python):
import sys
sys.setrecursionlimit(1000000)
from math import factorial, ceil, floor
from bisect import bisect_right as bsr
from operator import itemgetter as ig
from collections import defaultdict as dd
from collections import deque, Counter as cnt


args = None
INF = float("inf")
MOD = int(1e9 + 7)
def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]
def nlist(n, v):
    if not n: return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def main():
    N = input(int)
    A = input([int, N])
    B = input([int, N])
    C = input([int, N - 1])

    ans = 0    
    for n in range(N):
        ans += B[A[n] - 1]
        if 0 < n:
            if A[n - 1] + 1 == A[n]:
                ans += C[A[n - 1] - 1]
    print(ans)

    return

if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

d = 0 
s = sum(B) 

for i in range(N-1):
  if A[i]+1==A[i+1]:
    s += C[A[i]-1]

print(s)

Solution (Python):
N=int(input())
lsA=[int(s) for s in input().split()]
lsB=[int(s) for s in input().split()]
lsC=[int(s) for s in input().split()]
sum=lsB[lsA[0]-1]
for i in range(1,N):
  a=lsA[i]
  if lsA[i-1]+1==a:
    sum+=lsB[a-1]+lsC[a-2]
  else:
    sum+=lsB[a-1]
print(sum)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
r = sum(b)
for i in range(n - 1):
    if a[i + 1] == a[i] + 1:
        r += c[a[i] - 1]
print(r)

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())

def main():
    N = ii()
    A, B, C = lmis(), lmis(), lmis()
    ans = B[A[0]-1]
    for i in range(1, N):
        a = A[i]-1
        ans += B[a]
        if A[i]-A[i-1]==1:
            ans += C[a-1]
    
    print(ans)

main()

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N = INT()
A = LIST()
B = LIST()
C = [0] + LIST()

ans = 0
for i in range(1, N):
    if A[i-1]+1 == A[i]:
        ans += C[A[i]-1]
ans += sum(B)

print(ans)

Solution (Python):
n = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = 0
prev = -1
for i in A:
    ans += B[i-1]
    if prev == i - 1:
        ans += C[prev-1]
    prev = i
print(ans)

Solution (Python):

N = int(input())



A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))

ans=0
remind_i = N+100

for i in A:
    ans+=B[i-1]
    if i-remind_i==1:
        ans+=C[remind_i-1]
    remind_i = i





print(str(ans))

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
ans = sum(b)
for i in range(n-1):
  if a[i+1]==a[i]+1:
    idx = a[i]-1
    ans += c[idx]
print(ans)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))

ans = sum(B)
for i in range(1,N):
    if A[i] - 1 == A[i-1]:
        ans += C[A[i]-2]

print(ans)

Solution (Python):
n = int(input())
*an, = map(int,input().split())
*bn, = map(int,input().split())
*cn, = map(int,input().split())
befi = -1
ans = sum(bn)
for i in an:
  if i - befi == 1:
    ans += cn[befi-1]
  befi = i
print(ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

result = 0
prev = -1
for i in A:
  result += B[i-1]
  if prev == i-1 and i -2 >= 0:
    result += C[i-2]
  prev = i
  
print(result)

Solution (Python):
N = int(input())
A = [int(i) - 1 for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]


lastEatIdx = -999
ans = 0
for eatIdx in A:
    ans += B[eatIdx]
    if eatIdx == lastEatIdx + 1:
        ans += C[lastEatIdx]
    lastEatIdx = eatIdx

print(ans)

Solution (Python):

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
for i in range(N):
    ans += B[A[i]-1]
    past = A[i]
    if i != 0 and A[i-1] + 1 == A[i]:
        ans += C[A[i]-2]
print(ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
b = -1
for i in A:
    ans += B[i-1]
    if b == i - 1:
        ans += C[b-1]
    b = i

print(ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
manzoku = 0

for i in range(N):
    manzoku += B[A[i]-1]
    if i != 0 and A[i-1]+1 == A[i]:
        manzoku += C[A[i-1]-1]
print(manzoku)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

ans = sum(B)
for i in range(N-1):
    if A[i+1] - A[i] == 1:
        ans += C[A[i] - 1]

print(ans)

Solution (Python):
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
res = 0

for i, k in enumerate(A):
  res += B[k-1]
  if A[i-1] == k-1 and i != 0:
    res += C[k-2]
    
print(res)

Solution (Python):
def func():
    N = int(input())
    A = list(map(lambda x: int(x) -1, input().split()))
    B = list(map(int, input().split()))
    C = list(map(int, input().split()))

    prevIdx = -1
    value = 0
    for i in A:
        value += B[i]
        if prevIdx != -1 and prevIdx + 1 == i:
            value += C[i-1]
        
        prevIdx = i

    print(value)

if __name__ == '__main__':
    func()

Solution (Python):

import sys
from operator import itemgetter
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy
from collections import Counter, deque
import heapq
from functools import reduce
sys.setrecursionlimit(200000)





input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()



def main():
    N = ii()
    A = lmi()
    B = lmi()
    C = lmi()
    ans = 0
    for i in range(N - 1):
        if A[i] + 1 == A[i + 1]:
            ans += C[A[i] - 1]
    ans += sum(B)
    print(ans)
    return


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
tmp = float("inf")
ans = 0
for i in a:
    ans += b[i - 1]
    if tmp == i - 1:
        ans += c[tmp - 1]
    tmp = i
print(ans)

Solution (Python):
n = int(input())
A = [int(a) for a in input().split()] + [10000]
B = [int(b) for b in input().split()]
C = [int(c) for c in input().split()]
ans = 0
for i,j in enumerate(A[:len(A)-1]):
    ans += B[i]
    if A[i+1] == j+1:
        ans += C[j-1]
        
print(ans)

Solution (Python):
n = int(input())
a_list , b_list, c_list = [ int(v)-1 for v in input().split() ], [ int(v) for v in input().split() ], [ int(v) for v in input().split() ]
before = None
total = 0
for i in range(n):
    total += b_list[a_list[i]]
    if i > 0 and a_list[i-1] + 1 == a_list[i]:
        total += c_list[a_list[i-1]]
    before = i
print(total)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))

manzoku = 0

for i in range(n):
    eat = a[i] - 1
    manzoku = manzoku + b[eat]
    if i >= 1:
        if a[i] - a[i - 1] == 1:
            manzoku = manzoku + c[a[i - 1] - 1]

print(manzoku)

Solution (Python):


N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

output = 0
for i in range(N):
    output += B[A[i]-1]
    if i > 0 and A[i] == A[i-1]+1:
        output += C[A[i-1]-1]

print(output)

Solution (Python):

N = int(input())

A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))

ans = sum(B)

for i in range(N-1):

    if A[i] + 1 == A[i+1]:

        ans += C[A[i]-1]

print (ans)

Solution (Python):
import sys
n = int(input())
a_ls = [int(i) for i in sys.stdin.readline().split()]
b_ls = [int(i) for i in sys.stdin.readline().split()]
c_ls = [int(i) for i in sys.stdin.readline().split()]
cnt = 0
for i in range(n-1):
    if a_ls[i+1] - a_ls[i] == 1:
        cnt += c_ls[a_ls[i]-1]
cnt += sum(b_ls)
print(cnt)

Solution (Python):
N = int(input())

A = [int(_) for _ in input().split()]
B = [int(_) for _ in input().split()]
C = [int(_) for _ in input().split()]

count = 0
for n in range(N):
    count += B[A[n] - 1]
    if n != N - 1:
        if A[n + 1] - 1 == A[n]:
            count += C[A[n] - 1]
print(count)

Solution (Python):
n = int(input())
la = list(map(int, input().split()))
lb = list(map(int, input().split()))
lc = list(map(int, input().split()))

res = sum(lb)
for a0, a1 in zip(la, la[1:]):
    if a1 == a0 + 1:
        res += lc[a0 - 1]
print(res)

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))

out=sum(B)

for i in range(N-1):
    if A[i]==A[i+1]-1:
        out+=C[A[i]-1]

print(out)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()] 
b = [int(i) for i in input().split()] 
c = [int(i) for i in input().split()] 

ans = 0
for i in range(n):
    A = a[i]-1
    ans += b[A]
    if i > 0:
        if a[i] == a[i-1]+1:
            ans += c[A-1]

print(ans)

Solution (Python):
N = int(input())
a_list = list(map(int,input().split()))
b_list = list(map(int,input().split()))
c_list = list(map(int,input().split()))

a_list = [a-1 for a in a_list]

sat = 0
sat += sum(b_list)

for i in range(len(a_list)-1):
    if a_list[i+1] - a_list[i] == 1:


        sat += c_list[a_list[i]]
        
print(sat)

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    N = r_int()
    A = R()
    B = R()
    C = R()
    
    ans = sum(B)
    tmp = A[0]
    for i in range(1, N):
        a = A[i]
        if a - tmp == 1:
            ans += C[a-2]
        tmp = a
    print(ans)

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):

N=int(input())
A=list(map(int,input().split(" ")))
B=list(map(int,input().split(" ")))
C=list(map(int,input().split(" ")))

ans=0
for i in range(N):
    ans+=B[A[i]-1]
    if i<N-1:
        if A[i+1]==A[i]+1:
            ans+=C[A[i]-1]

print(ans)

Solution (Python):
def getlist():
	return list(map(int, input().split()))

N = int(input())
A = getlist()
B = getlist()
C = getlist()
ans = 0

for i in range(N):
	ans += B[A[i] - 1]

for i in range(N - 1):
	if A[i + 1] - A[i] == 1:
		ans += C[A[i] - 1]

print(ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=0
pre =0
for i in a:
    ans+=b[i-1]
    if pre == i-1 and i!=1:
        ans+=c[i-2]
    pre=i
print(ans)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))

ans = 0
before_num = -1
for a in A:
  if before_num + 1 == a:
    ans += C[a-2]
  ans += B[a-1]
  
  before_num = a
  
print(ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
s = 0
for i in range(n):
    s += b[a[i]-1]
    if i > 0 and a[i] == a[i-1] + 1:
        s += c[a[i-1]-1]
print(s)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

scr = sum(B)
for i in range(1,N):
    if A[i] == A[i-1] + 1:
        scr += C[A[i]-2]

print(scr)

Solution (Python):
N = int(input())
A = [int(x) - 1 for x in input().split()]
B = [int(x) for x in input().split()]
C = [int(x) for x in input().split()]
cnt = 0
for i in range(N):
  cnt += B[A[i]]
for i in range(N - 1):
  if A[i] + 1 == A[i + 1]:
    cnt += C[A[i]]
print(cnt)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))

ans = 0
ans += b[a[0]-1]
for ii in range(n-1):
  i = ii+1
  ans += b[a[i]-1]
  if(a[i] == a[i-1]+1):
    ans+=c[a[i-1]-1]
print(ans)

Solution (Python):
def main():    
    n = int(input())
    a = list(map(int,input().split()))
    b = list(map(int,input().split()))
    c = list(map(int,input().split()))
    ans = sum(b)
    for i in range(n-1):
        if a[i]+1 == a[i+1]:
            ans += c[a[i]-1]
    print(ans)
    
if __name__ == '__main__':
    main()

Solution (Python):
def main():
    N = int(input())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
    C = list(map(int, input().split()))

    ans = 0
    tmp = -100
    for a in A:
        ans += B[a-1]
        if a - tmp == 1:
            ans += C[tmp-1]
        
        tmp = a

    print(ans)


main()

Solution (Python):
n = int(input())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
c = [int(x) for x in input().split()]

ans = sum(b)
for i in range(n-1):
    if a[i+1] - a[i] == 1:
        ans += c[a[i]-1]
print(ans)

Solution (Python):
from sys import stdin

N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
B = [int(x) for x in stdin.readline().rstrip().split()]
C = [int(x) for x in stdin.readline().rstrip().split()]

ans = 0

for i in range(N):
    ans += B[A[i] - 1]
    if i >= 1 and A[i - 1] + 1 == A[i]:
        ans += C[A[i - 1] - 1]

print(ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

prev = -1
ans = 0
for a in A:
    ans += B[a - 1]
    if prev == a -  1:
        ans += C[a - 2]
    prev = a
print(ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split())) 
B = list(map(int, input().split())) 
C = list(map(int, input().split()))

ans = 0
prev = None
for a in A:
    ans += B[a-1]
    if prev is not None and prev+1 == a:
        ans += C[prev-1]
    prev = a

print(ans)

Solution (Python):
N = int(input())
A_list = [int(elm) -1 for elm in input().split(" ")]
B_list = list(map(int, input().split(" ")))
C_list = list(map(int, input().split(" ")))

out = 0
for i in range(N):
    now = A_list[i]
    out += B_list[now]
    if i >= 1:
        if before +1 == now:
            out += C_list[before]

    before = now

print(out)

Solution (Python):
n = int(raw_input())
a = map(int,raw_input().split())
b = map(int,raw_input().split())
c = map(int,raw_input().split())
res = 0
prev = -1
for x in a:
	res += b[x-1]
	if x-1 == prev:
		res += c[x-2]
	prev = x
print res

Solution (Python):
words = lambda t : list(map(t, input().split()))
n = input()
a = words(int)
b = words(int)
c = words(int)

prev = -20
ans = 0
for aa in a:
    ans += b[aa-1]
    if prev == aa-2:
        ans += c[aa-2]
    prev = aa-1

print(ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
for i in range(N-1):
    a = A[i]-1
    b = B[a]
    ans+=b
    if a+1 == A[i+1]-1:
        c = C[a]
        ans+=c
ans+=B[A[-1]-1]
print(ans)

Solution (Python):
n = int(input())

a = list(map(lambda x: int(x) - 1, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))

res = 0
last = -100
for e in a:
    res += b[e]
    if e - last == 1:
        res += c[last]
    last = e 

print(res)

Solution (Python):
n=int(input())
a=list(map(int, input().split()))
b=list(map(int, input().split()))
c=list(map(int, input().split()))

ans=0
pre=-100
for val in a:
    ans+=b[val-1]
    if pre+1 == val:
        ans+=c[pre-1]
    pre=val
print(ans)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))

ans = B[A[0]-1]
for k in range(1,N):
    ans += B[A[k]-1]
    if A[k-1]+1 == A[k]:
        ans += C[A[k-1]-1]
print(ans)

Solution (Python):

n = int(input())
a = list(map(lambda x: int(x) - 1, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
s = 0
for i in range(n):
    s += b[a[i]]
for i in range(n - 1):
    if a[i] + 1 == a[i + 1]:
        s += c[a[i]]
print(s)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N = int(input())
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
C = [int(x) for x in input().split()]

x = sum(B)
for a,b in zip(A,A[1:]):
    if b == a+1:
        x += C[a-1]

print(x)

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    n = II()
    a_s = LI()
    b_s = LI()
    c_s = LI()
    ans = 0
    for i in range(n):
        ans += b_s[a_s[i] - 1]
        if i > 0 and a_s[i-1] + 1 == a_s[i]:
            ans += c_s[a_s[i-1] - 1]
    print(ans)

if __name__ == '__main__':
    main()