Is minimum weighted vertex cover for a tree and a DAG(Directed Acyclic Graph) same?

Question

There\'s an existing question regarding minimum weighted vertex cover for a tree. Currently I am working with a project where my network is a DAG. So what I need to know is