Hi , can someone tell me how the graph might look like based on the question below . Thank you.

“Given a weighted graph G = (V, E) and an integer d, does there exist a pair of subtrees T1 = (V1, E1) and T2 = (V2, E2) of G, such that V2 = V V1 (i.e. each vertex of G is in either T1 or T2), and the weight of the two trees sum to at most d”