import bisect

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    ptr = 0
    N = int(data[ptr])
    ptr +=1
    
    intervals = {}
    for _ in range(N):
        l = int(data[ptr])
        r = int(data[ptr+1])
        a = int(data[ptr+2])
        ptr +=3
        if a not in intervals:
            intervals[a] = []
        intervals[a].append((l, r))
    
    for a in intervals:
        intv = intervals[a]
        intv.sort()
        merged = []
        for l, r in intv:
            if not merged:
                merged.append([l, r])
            else:
                last_l, last_r = merged[-1]
                if l > last_r +1:
                    merged.append([l, r])
                else:
                    new_l = last_l
                    new_r = max(last_r, r)
                    merged[-1] = [new_l, new_r]
        intervals[a] = merged
    
    Q = int(data[ptr])
    ptr +=1
    queries = list(map(int, data[ptr:ptr+Q]))
    ptr +=Q
    
    for x in queries:
        mex = 0
        while True:
            if mex not in intervals:
                print(mex)
                break
            else:
                lst = intervals[mex]
                low = 0
                high = len(lst)-1
                found = False
                while low <= high:
                    mid = (low + high) // 2
                    l, r = lst[mid]
                    if l <= x <= r:
                        found = True
                        break
                    elif x < l:
                        high = mid -1
                    else:
                        low = mid +1
                if not found:
                    print(mex)
                    break
                mex +=1

if __name__ == "__main__":
    main()