#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

typedef long long ll;

int const maxn=1e5+,inf=0x3f3f3f3f;

int T,n,a[maxn];

ll f[maxn];

int main()

{

    scanf("%d",&T);

    while(T--)

    {

        scanf("%d",&n);

        for(int i=;i<=n;i++)scanf("%d",&a[i]);

        memset(f,0x3f,sizeof f);

        f[]=;

        for(int i=;i<=n;i++)

            for(int j=max(,i-);j<i;j++)

                f[i]=min(f[i],f[j]+*a[i]);

        ll ans=inf;

        for(int i=n;i>n-;i--)ans=min(ans,f[i]);

        printf("%lld\n",ans);

    }

    return ;

}