3203. Find Minimum Diameter After Merging Two Trees

Given two trees (edges1, edges2), connect them with a single edge (any vertex of the first to any vertex of the second) so the resulting tree's diameter is minimized; return that minimum diameter.