How to update MST from the old MST if one edge is deleted

I am studying algorithms, and I have seen an exercise like this

I can overcome this problem with exponential time but. I don't know how to prove this linear time O(E+V)

I will appreciate any help.