Can anyone help me solve below problem?

Given an array with N numbers and given list of pair of integers u and v where each entry is two indices which cannot be together in chosen subset.Tell maximum possible size of such subset.

Don't worry about constraints tell your best solution.