Given an undirected graph $G=(V,E)$ and weight function: $ w: E rightarrow {1,2,…,10}$.

Describe an algorithm that finds the set of all edges $ein E$ for which there is a circle $C$ in $G$ that contains $e$ such that for every $e’ in C, e’neq e$ : $w(e’)leq w(e)$.

I thought maybe because the weights are bounded I can run Kruskal multiple times and each time delete edges with a specific weight, and that without changeing the complexity.

Would appreciate your help:)