Maximize Alternating Sum Using Swaps

You are given an integer array nums and a 2D integer array swaps, where each element swaps[i] = [pi, qi] represents a pair of indices in nums.
For every pair [pi, qi], you are allowed to swap the elements at indices pi and qi.
You can perform these swaps any number of times and in any order.
Your goal is to maximize the alternating sum of the array nums, where:
alternating sum=nums[0]−nums[1]+nums[2]−nums[3]+…
Return the maximum possible alternating sum you can achieve after performing the swaps optimally.