#include<algorithm>
#include<iostream>
using namespace std;

#define prep(i,a,b) for(int i = (a); i <= (b); i ++)
#define rrep(i,a,b) for(int i = (a); i >= (b); i --)

typedef long long LL;
const char nl = '\n';
int T, n, m;
const int N = 1e5 + 10;
LL a[N];	//注意求和的数据范围

void solve() {
	res = 0;
	cin >> n;
	prep(i,1,n){
		cin >> a[i];
		if(a[i] < 0)a[i] *= (-1);
		a[i] += a[i - 1];
	}

	cout << 2*n*a[n] << nl;

}

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