3608. Minimum Time for K Connected Components

You are given an integer n and an undirected graph with n nodes labeled from 0 to n - 1. This is represented by a 2D array edges, where edges[i] = [ui, vi, timei] indicates an undirected edge between nodes ui and vi that can be removed at timei. You are also given an integer k. Initially, the graph may be connected or disconnected. Your task is to find the minimum time t such that after removing