Before revision:  We illustrate this difficulty by classifying the complexity of the problem when H is a (reflexive or irreflexive)tree .
After revision:  We illustrate this difficulty by classifying the complexity of the problem when H is a tree (with possible loops) .