Each time, Matir can choose a simple path on the tree, and ask whether the path has any marked edge or not.
1) How many times of asking can guarantee the set of marked edges?
2) If Matir knows that there are exactly $\lfloor\frac {x}{2} \rfloor $ marked edges, how many times of asking can guarantee the set of marked edges?