#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int n, i;
long long int a[1001], d[1001];
cin>>n;
for(i = 0; i < n; i++)
cin>>a[i];
d[0] = a[0];
d[1] = max(d[0], a[1]);
for(i = 2; i < n; i++)
d[i] = max(d[i-1], a[i] + d[i-2]);
cout<<d[n-1]<<endl;
}
int main(){
ll t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHNvbHZlKCl7CglpbnQgbiwgaTsKCWxvbmcgbG9uZyBpbnQgYVsxMDAxXSwgZFsxMDAxXTsKCWNpbj4+bjsKCWZvcihpID0gMDsgaSA8IG47IGkrKykKCQljaW4+PmFbaV07CglkWzBdID0gYVswXTsKCWRbMV0gPSBtYXgoZFswXSwgYVsxXSk7Cglmb3IoaSA9IDI7IGkgPCBuOyBpKyspCgkJZFtpXSA9IG1heChkW2ktMV0sIGFbaV0gKyBkW2ktMl0pOwoJY291dDw8ZFtuLTFdPDxlbmRsOwp9CgppbnQgbWFpbigpewoJbGwgdD0xOwoJY2luPj50OwoJd2hpbGUodC0tKXsKCQlzb2x2ZSgpOwoJfQoJcmV0dXJuIDA7Cn0=