#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


ll solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    cin >> a;

    const ll INF = 1e18;
    vector<vector<ll>> dp(3, vector<ll>(2, -INF));
    dp[0][0] = a[0], dp[0][1] = -a[0];
    rep(i, n-1) {
        vector<vector<ll>> pre(3, vector<ll>(2, -INF));
        swap(pre, dp);
        rep(j, 3) rep(k, 2) {
            chmax(dp[j][k], pre[j][k] + a[i+1] * (k == 0 ? 1 : -1));
            if(j == 2) continue;
            chmax(dp[j+1][0], pre[j][k] + a[i+1]);
            chmax(dp[j+1][1], pre[j][k] - a[i+1]);
        }
    }
    return max(dp[2][0], dp[2][1]);
}

int main() {
    int t;
    cin >> t;
    rep(i, t) cout << solve() << '\n';
    return 0;
}