Embedding a Forest in a Graph

For p >= 1, we prove that every forest with p trees whose sizes are a(1),..., a(p) can be embedded in any graph containing at least Sigma(p)(i=1) (a(i) + 1) vertices and having minimum degree at least P Sigma(p)(i=1)a(i).