A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources