#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
	int n; cin >> n;
	vector<ll> a(n+1, 0LL);
	for(int i=1; i<=n; i++) cin >> a[i];
	vector<ll> sum(n+1, 0LL);
	for(int i=1; i<=n; i++) sum[i] = sum[i-1] + a[i];

	ll ans = -LINF;
	ll mn = 0LL, mx = 0LL;
	for(int i=1; i<=n; i++){
		ans = max(ans, abs(sum[i])-mn+abs(mn)+abs(sum[n]-sum[i]));
		ans = max(ans, abs(mx-sum[i])+abs(mx)+abs(sum[n]-sum[i]));
		mn = min(mn, sum[i]);
		mx = max(mx, sum[i]);
	}

	cout << ans << '\n';
}

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