#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;

void solve(){
    int n, v;
    cin >> n;
    array<ll, 6> dp;
    dp.fill(0);
    for(int i = 0; i < n; i++){
        array<ll, 6> ndp;
        ndp.fill(-(1ll << 62));
        cin >> v;
        for(int j = 0; j < 6; j++){
            if(j % 2 == 0){
                ndp[j] = max(ndp[j], dp[j] + v);
                for(int k = (j / 2) * 2 - 1; k >= 0; k--){
                    ndp[j] = max(ndp[j], dp[k] + v);
                }
            }else{
                ndp[j] = max(ndp[j], dp[j] - v);
                for(int k = (j / 2) * 2 - 1; k >= 0; k--){
                    ndp[j] = max(ndp[j], dp[k] - v);
                }
            }
        }
        dp = ndp;
    }
    cout << *max_element(dp.begin(), dp.end()) << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) solve();
}