class Solution {
    public int[] sumEvenAfterQueries(int[] nums, int[][] queries) {
        int sum=0;
        for(int n: nums) if(n%2==0) sum+=n;
        int[] ans = new int[queries.length];
        for(int i=0; i<queries.length; i++){
            if((nums[queries[i][1]]+queries[i][0]) %2==0){
                if(nums[queries[i][1]]%2==0)
                    sum+=queries[i][0];
                else
                    sum+=nums[queries[i][1]]+queries[i][0];
            }else{
                if(nums[queries[i][1]] %2==0)
                    sum-=nums[queries[i][1]];
            }
            nums[queries[i][1]]+=queries[i][0];
            ans[i]=sum;
        }
        return ans;
    }
}