Clearly it's 4(n-1).
I'm answering it by procedure although we can answer such question by hit and trial method also.
as the graph is connected and it has n vertices.
for spanning tree we need those n-1 edges that corresponds to total minimum weight (no cycle of course)
Now one time focus 4|i-j| , think for second how can this be minimum , yes it would be minimum for adjacent edges as for adjacent edges |i-j|=1 and simply there would be n-1 such adjacent edges (in that way MST property is saved)
so ultimately n-1 edges each having 4 weight => 4(n-1)
in hit and trial take any connected graph (for easiness take triangle) and apply some MST algo and put the values and cross check answer.