只拿了10分，其他Rel

T = int(input())
q = 0


def dfs(a, t, b, n):
    global q

    if a == b:
        q = 1
    else:
        count = 0
        for i in range(0, n):
            if a[i] + t[i] > b[i]:
                count = 1
                break
        if count == 0:
            e = [0] * n
            f = [0] * n
            for i in range(0, n):
                e[i] = t[i] + a[i]
                f[i] = t[n - i - 1] + t[i]
            dfs(a, f, b, n)
            dfs(e, t, b, n)


z = [''] * T
for j in range(0, T):
    N = int(input())
    x1 = input().split(' ')
    y1 = input().split(' ')
    A = [0] * N
    M = [0] * N
    B = [0] * N
    for k in range(0, N):
        M[k] = int(x1[k])
        B[k] = int(y1[k])
    dfs(A, M, B, N)
    if q == 1:
        z[j] = 'Yes'
        q = 0
    else:
        z[j] = 'No'
for w in range(0, T):
    print(z[w])