#include <bits/stdc++.h>

using i64 = int64_t;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }

    if (std::all_of(a.begin(), a.end(), [](int x) {
            return x <= 0;
        })) {
        for (int &i : a) {
            i = -i;
        }
    }

    bool neg = false, pos = false;
    for (int i = 0; i < n; ++i) {
        if (a[i] <= 0)
            neg = true;
        if (a[i] >= 0)
            pos = true;
    }
    if (neg && pos) {
        i64 ans = 0;
        for (int i = 0; i < n; ++i) {
            if (a[i] < 0) {
                ans += -a[i];
            } else {
                ans += a[i];
            }
        }
        std::cout << ans << '\n';
    } else {
        std::cout << std::accumulate(a.begin(), a.end(), 0LL) -
                         *std::min_element(a.begin(), a.end()) * 2LL
                  << '\n';
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }
}