partition a graph

Given a weighted graph G=(V,E) design an algorithm to partition the edge set E into disjoint sets X and Y(E=X U Y) such that X comprises of all those edges which do not appear in any of the minimal spanning tree of the given graph G.