// ---------- begin scannner ----------
#[allow(dead_code)]
mod scanner {
    use std::str::FromStr;
    pub struct Scanner<'a> {
        it: std::str::SplitWhitespace<'a>,
    }
    impl<'a> Scanner<'a> {
        pub fn new(s: &'a String) -> Scanner<'a> {
            Scanner {
                it: s.split_whitespace(),
            }
        }
        pub fn next<T: FromStr>(&mut self) -> T {
            self.it.next().unwrap().parse::<T>().ok().unwrap()
        }
        pub fn next_bytes(&mut self) -> Vec<u8> {
            self.it.next().unwrap().bytes().collect()
        }
        pub fn next_chars(&mut self) -> Vec<char> {
            self.it.next().unwrap().chars().collect()
        }
        pub fn next_vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
            (0..len).map(|_| self.next()).collect()
        }
    }
}
// ---------- end scannner ----------

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    use std::io::Read;
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut sc = scanner::Scanner::new(&s);
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    run(&mut sc, &mut out);
}

fn run<W: Write>(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter<W>) {
    let t: u32 = sc.next();
    for _ in 0..t {
        let n: usize = sc.next();
        let a: Vec<i64> = sc.next_vec(n);
        let ans = solve(a);
        writeln!(out, "{}", ans).ok();
    }
}

fn solve(a: Vec<i64>) -> i64 {
    let n = a.len();
    let mut sum = vec![0; a.len() + 1];
    for i in 0..a.len() {
        sum[i + 1] = sum[i] + a[i];
    }
    let mut ans = sum[n].abs();
    let mut min = sum[1];
    let mut max = sum[1];
    for i in 2..n {
        ans = ans.max(min.abs() + (sum[i] - min).abs() + (sum[i] - sum[n]).abs());
        ans = ans.max(max.abs() + (sum[i] - max).abs() + (sum[i] - sum[n]).abs());
        min = min.min(sum[i]);
        max = max.max(sum[i]);
    }
    ans
}