#include<iostream>
#include<algorithm>
using namespace std;
int n,w[100005],f[100005][2],T,i;
int main()
{
scanf("%d",&T);
while (T--){
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&w[i]);
for(i=1;i<=n;i++)f[i][0]=max(f[i-1][0],f[i-1][1]),f[i][1]=f[i-1][0]+w[i];
printf("%d\n", max(f[n][0], f[n][1]));
}
return 0;
}