We propose a coinductive variant of Knuth-Yao trees (variously, Discrete Distribution Generating trees) as an intermediate representation supporting exact inference for probabilistic programs which may contain loops with probabilistic termination conditions. We provide a prototype implementation of a probabilistic programming language, Zar, written in Haskell, exemplifying both Knuth-Yao trees as well as exact inference on the trees.