Show that finding a minimum-weight subgraph that includes all marked nodes is NP-hard
This is the problem of finding a Steiner tree in the graph. It's one of the NP-complete problems in Karp's original paper; the reduction there is from Exact cover by 3-sets.