No Code please. Only Pseudocode

Let G(V, E) be a connected graph with costs c(e) over the edges. A spanning tree has diameter 3 if the distance in T between every two vertices is at most 3. Give an algorithm that finds the minimum cost tree, among all trees with diameter at most of 3 (if exists)