def solve():
    import sys
    input = sys.stdin.read
    data = input().split()
    
    index = 0
    t = int(data[index])
    index += 1
    results = []
    
    for _ in range(t):
        n = int(data[index])
        index += 1
        a = list(map(int, data[index:index + n]))
        index += n
        b = list(map(int, data[index:index + n]))
        index += n
        
        good_markers = []
        for i in range(n):
            good_markers.append(b[i])
        
        good_markers.sort(reverse=True)
        
        # We need at least 2 good markers from different colors
        if len(good_markers) < 2 or good_markers[0] == 0 or good_markers[1] == 0:
            results.append("YES")
        else:
            results.append("NO")
    
    print('\n'.join(results))