Minimize Blocked Roads

Given a network of $N$ cities (numbered from $1$ to $N$) and $(N-1)$ roads arranged in a tree format with the root at city $1$. Each of the $(N-1)$ roads is assigned a value of either $0$ or $1$. - If the value of a road is $0$, it cannot be blocked by the government. - If the value of a road is $1$, it may or may not be blocked depending on the decision of the government. Initially, city nu