Polytree

A Graph is called a Polytree if there is at most one undirected Path between any two nodes in it.