/************************************
Note Book:
************************************/
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <math.h>
#define LL long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
int t , n , maxx;
int  a[N];
int dp[N];
int main()
{
	cin >> t;
	while( t-- )
	{
		cin >> n;
		for(int i = 1; i <= n; i++)
		{
			cin >> a[i];
		}
		memset(dp , 0 , sizeof dp);
		dp[1] = a[1];
		for(int i = 2; i <= n; i++)
		{
			dp[i] = max(dp[i - 1] , dp[i - 2] + a[i]);
		}
		cout << dp[n] << endl;
	}
	return 0;
}