Retrieve all associated (double-chained) paths that exist between two arbitrary tiddlers by double-linking

could you perhaps tell us the exact outcome you want to see for the example you have provided

are you looking for some kind of filter that can give you a list of tiddlers linked together in a hierarchy? , Ancestors and descendants filter operators or
Release: Improved performance of Kin filter

otherwise i am bit confused as to what you want to achieve?