def solve():
    n = int(input())
    a = list(map(int, input().split()))
    
    inf = 10**18
    dp = [[[-inf] * (n + 1) for _ in range(3)] for _ in range(2)]
    dp[0][0][0] = 0
    dp[0][0][1] = 0
    for i, x in enumerate(a):
        for j in range(3):
            dp[0][j][i + 1] = dp[0][j][i] + x
            dp[1][j][i + 1] = dp[1][j][i] - x
        if i > 0:
            for j in range(2):
                dp[0][j + 1][i + 1] = max(dp[0][j + 1][i + 1], dp[0][j][i] + x, dp[1][j][i] + x)
                dp[1][j + 1][i + 1] = max(dp[1][j + 1][i + 1], dp[0][j][i] - x, dp[1][j][i] - x)
    ans = max(dp[0][2][n], dp[1][2][n])
    print(ans)

t = int(input())
for _ in range(t):
    solve()