Before revision:  We also generalize the polynomial-time result of Papadopoulos and Tzimas for Weighted Subset Feedback Vertex Set on 4P_1-free graphs to (3P_1+P_2)-free graphs. As a consequence, we show that the complexity for both of the weighted subset transversal problems restricted to H-free graphs remains open for just three particular graphs~H .
After revision:  We also generalize the polynomial-time result of Papadopoulos and Tzimas .