In many application scenarios the underlying structure of a distributed system is described by using a graph representing the influence among its individual components. Indeed, given an unknown complex system, deriving information about its connectivity structure is often the first step to understand its fundamental mechanisms. There are several techniques in the scientific literature to infer influence diagrams for networks of dynamic systems, however, most of them can not deal with the presence of latent (unmeasured) components. The article provides sufficient conditions for reconstruction of networks of dynamic systems with polytree structure in the presence of latent nodes. No a priori assumptions are made about the location and number of hidden nodes.