and bi in the first tree and edges2[i] = [ui, vi] indicates that there is an edge between nodes ui and vi in the second tree.

You must connect one node from the first tree with another node from the second tree with an edge.

Return the minimum possible diameter of the resulting tree.

The diameter of a tree is the length of the longest path between any two nodes in the tree.

graph TD
    subgraph Tree_1
        0 --- 1
        0 --- 2
        0 --- 3
    end

    subgraph Tree_2
        A[0] --- B[1]
    end

    0 -.- A

Input: edges1 = [[0,1],[0,2],[0,3]], edges2 = [[0,1]]
Output: 3