import bisect
from collections import defaultdict

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    ptr = 0
    
    n = int(data[ptr])
    ptr += 1
    
    operations = defaultdict(list)
    for _ in range(n):
        l = int(data[ptr])
        r = int(data[ptr + 1])
        a = int(data[ptr + 2])
        ptr += 3
        operations[a].append((l, r))
    
    processed = {}
    for a in operations:
        intervals = operations[a]
        intervals.sort()
        merged = []
        for interval in intervals:
            if not merged:
                merged.append(interval)
            else:
                last = merged[-1]
                if interval[0] <= last[1] + 1:
                    new_start = last[0]
                    new_end = max(last[1], interval[1])
                    merged[-1] = (new_start, new_end)
                else:
                    merged.append(interval)
        starts = [interval[0] for interval in merged]
        processed[a] = (merged, starts)
    
    q = int(data[ptr])
    ptr += 1
    queries = list(map(int, data[ptr:ptr + q]))
    ptr += q
    
    for x in queries:
        k = 0
        found = False
        while True:
            if k not in processed:
                print(k)
                break
            else:
                merged, starts = processed[k]
                pos = bisect.bisect_right(starts, x) - 1
                if pos >= 0:
                    s, e = merged[pos]
                    if s <= x <= e:
                        k += 1
                    else:
                        print(k)
                        break
                else:
                    print(k)
                    break

if __name__ == "__main__":
    main()