#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int dp[N],a[N],n,MAX,pre[N];
int main() {
int t;
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; i++)cin >> a[i], dp[i] = a[i];//输入的同时初始化dp边界
for (int i = 2; i <= n; i++) {//枚举终点
dp[i] = max(dp[i], dp[i - 2] + a[i]);
dp[i] = max(dp[i], dp[i - 1]);
}
cout << dp[n]<<endl;
}
return 0;
}