First, let me remind chord of graph. An edge which joins two vertices of a cycle but is not itself an edge of cycle is chord of that cycle.
Now, I want to show that if a graph has spanning tree with infinitely many chords then all its spanning trees have infinitely many chords.