Given an undirected weighted graph. How to find the total number of minimum spanning tree for that given graph.

Number of nodes <= 10. No parallel edges.

I found a similar problem here: https://www.spoj.com/problems/MSTS/

I don't want answer mod 31011 as asked in above Spoj Problem. I want the exact number of ways. (Though I don't know the solution of the Spoj problem either.)

Can someone please help me in solving this question?

Thanks in advance.

Happy Coding :)