import bisect
from collections import defaultdict

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    n = int(input[ptr])
    ptr += 1

    operations = defaultdict(list)
    for _ in range(n):
        l = int(input[ptr])
        r = int(input[ptr+1])
        a = int(input[ptr+2])
        ptr +=3
        operations[a].append((l, r))

    merged = dict()

    for a in operations:
        intervals = operations[a]
        intervals.sort()
        merged_intervals = []
        for interval in intervals:
            if not merged_intervals:
                merged_intervals.append(interval)
            else:
                last = merged_intervals[-1]
                if interval[0] <= last[1] + 1:
                    new_l = last[0]
                    new_r = max(last[1], interval[1])
                    merged_intervals[-1] = (new_l, new_r)
                else:
                    merged_intervals.append(interval)
        starts = [x[0] for x in merged_intervals]
        ends = [x[1] for x in merged_intervals]
        if not starts:
            continue
        min_l = starts[0]
        max_r = ends[-1]
        merged[a] = (min_l, max_r, starts, ends)

    q = int(input[ptr])
    ptr +=1
    queries = list(map(int, input[ptr:ptr+q]))
    ptr += q

    for x in queries:
        k = 0
        while True:
            if k not in merged:
                print(k)
                break
            else:
                min_l, max_r, starts, ends = merged[k]
                if x < min_l or x > max_r:
                    print(k)
                    break
                idx = bisect.bisect_right(starts, x) - 1
                if idx >=0 and ends[idx] >= x:
                    k +=1
                else:
                    print(k)
                    break

if __name__ == "__main__":
    main()