def count_covered_ranges(N, P, A):
    mod = 10**9 + 7

    def dfs(node, parent_value):
        if P[node] == 0:
            return [A[node]]

        ranges = dfs(P[node], parent_value)
        if A[node] >= parent_value:
            ranges.append(A[node])
        else:
            ranges.extend([A[node], parent_value])

        ranges.sort()
        merged = [ranges[0]]
        for r in ranges[1:]:
            if merged[-1] == r:
                continue
            if merged[-1] + 1 == r:
                merged[-1] = r
            else:
                merged.append(r)

        return merged

    return sum(len(dfs(i, 0)) for i in range(N)) % mod

INFOSYS//Path covered Ranges✅