Path Existence Queries in a Graph I

Given sorted values nums and a threshold maxDiff, determine for each query whether two node indices lie in the same connected component of an undirected graph where an edge exists between any pair whose values differ by at most maxDiff. This reduces to grouping indices into contiguous components (or using a disjoint-set) based on adjacent value differences ≤ maxDiff and checking if u and v share a component.