We show that there exists a graph G with n \cdot 2^{0(\log* n)} nodes, where any forest with n nodes is a node-induced subgraph of G. Furthermore, the result implies existence of a graph with n^k 2^{0(\log* n)} nodes that contains all n-node graphs of fixed arboricity k as node-induced subgraphs. We provide a lower bound of \Omega (n^k) for the size of such a graph. The upper bound is obtained through a simple labeling scheme for parent queries in rooted trees.