import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 1 << 63
# md = 998244353
md = 10**9+7

def solve():
    def iskado(i):
        a, b, c = aa[i-2:i+1]
        if a == b or b == c or c == a: return False
        return max(a, b, c) == b or min(a, b, c) == b

    n = II()
    aa = LI()
    aa += aa

    ans = 0
    for si in range(3):
        dp = [0]*(n+1)
        for i in range(2,n):
            dp[i+1] = dp[i]
            if iskado(si+i): dp[i+1] = max(dp[i+1], dp[i-2]+aa[si+i-2])
        # print(si,dp)
        ans = max(ans, dp[-1])

    print(ans)

for _ in range(II()):
    solve()