Before revision:  We present a new algorithm for sampling  arbitrary motifs which, up to   (\log n) factors, for any motif H whose decomposition contains at least two components or at least one star, is always preferable .
After revision:  We present a new algorithm for sampling arbitrary motifs which, up to  (\log n) factors, is always at least as good as previous results, and for most graphs G is strictly better .