Graph Theory - Minimum Spanning Tree

Let G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G. For any two vertices, u and v, let d₁(u, v) and d₂(u, v) be the shortest distances between u and v in G and T, respectively...

The maximum value of x such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________. (answer in integer)