Degree conditions for forests in graphs

If H is any forest of order n with m edges, then any graph G of order ⩾n with d(u)+d(v)⩾2m-1 for any two non-adjacent vertices u,v contains H.