Checking Existence of Edge Length Limited Paths II

Design a data structure to handle a sequence of operations that add weighted edges and answer whether two nodes are connected by a path whose every edge is below a given length limit; the core challenge is efficient dynamic connectivity under weight thresholds, typically solved by ordering edges/queries and using union-find variants (e.g., offline processing or DSU with rollback/segment-tree techniques).