import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
import heapq



def main():
    n,m = map(int,input().split())
    cap = list(map(int,input().split()))

    data = []


    remain = cap[:]

    for _ in range(m):
        x,i = map(int,input().split())
        data.append((x,i-1))


    inf = 10**18
    for i in range(n):
        data.append((inf+i,i))

    m = len(data)

    curr = 0
    while True:

        mind = 2*inf
        minpick = -1
        for i in range(m):
            if data[i][0] == curr:
                remain[data[i][1]] = cap[i]
        
        for i in range(m):
            if data[i][0] <= curr:  continue 
            if data[i][0] < mind and remain[data[i][1]] > 0:
                mind = data[i][0]
                minpick = data[i][1]

        if minpick < 0:
            curr += sum(remain)
            break

        curr += 1
        remain[minpick] -= 1


    print(curr)          
                
                


    

        
        
            
            
        


            

 
            


    






T = int(input())
t = 1
while t <= T:
    main()
    t += 1