Leetcode 2867. Count Valid Paths in a Tree

Count the number of unordered node pairs (a, b) in a tree whose simple path contains exactly one prime-labeled node. With n up to 1e5, this requires preprocessing primes and an O(n)–O(n log n) tree traversal/counting approach to aggregate path counts efficiently.