you given weight undirected graph n vertex q triple u v l triple u v vertex l positive integer an edge e call useful triple u v l path necessarily simple follow property u v endpoint path e edge path sum weight edge path do not exceed l please print number useful edge graph