title: SPARQL query to construct sub-graph with select paths (paths have different lengths)
body: <p>Is it possible to <code>CONSTRUCT</code> an RDF sub-graph that contains nodes A, B, C, E, F (but no D, G, H) from the following graph using a single SPARQL query:</p>
  
  <pre><code>:A :p :B .
  :A :q :C .
  :A :r :D .
  :A :s :E . :E :t :F .
  :A :u :G . :G :v :H .
  </code></pre>
  
  <p>I know how to formulate a SPARQL query that returns { A-p-B, A-q-C } (i.e. two paths consisting of 1 statement each) and one that returns { A-s-E E-t-F } (i.e. one path consisting of 2 statements). But it it possible to fold both into as single SPARQL <code>CONSTRUCT</code> query and if so, how would that look?</p>