Difficulties proving when a language is in P or is NP-complete
The language $L_1$ is in P since you can brute force an optimal vertex cover in each connected component.
The language $L_2$ is NP-hard by reduction from vertex cover. Roughly, given an arbitrary graph, we have to make it connected and to add another connected component, controlling the change of the minimum vertex cover throughout the process.