#include <bits/stdc++.h>
using namespace std;
const int N=1e6+10;
typedef long long ll;

namespace IO {
    constexpr int BUFSIZE = 1 << 20;
    char ibuf[BUFSIZE], *is = ibuf, *it = ibuf, tmp[BUFSIZE];
    int cnt = 0;
    inline char get() {
        if (is == it) it = (is = ibuf) + fread(ibuf, 1, BUFSIZE, stdin);
        return is == it ? EOF : *is++;
    }
    inline int read() {
        int x = 0, neg = 0;
        char c = 0;
        while (!isdigit(c)) neg |= c == '-', c = get();
        while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = get();
        return neg ? -x : x;
    }
    void flush() {
        fwrite(tmp, 1, cnt, stdout);
        cnt = 0;
    }
    struct AutoFlush {
        ~AutoFlush() { flush(); }
    } flusher;
    inline void put(char c) {
        tmp[cnt++] = c;
        if (cnt == BUFSIZE) flush();
    }
    void print(int x) {
        char s[10];
        int tp = 0;
        if (x < 0) put('-'), x = -x;
        if (x == 0) put('0');
        while (x) s[tp++] = (x % 10 + '0'), x /= 10;
        while (tp--) put(s[tp]);
    }
}
using IO::read;
using IO::print;
using IO::put;

int T;
int n,m;
int a[N],b[N];
int s[N];
int sum[N];
int pre[N],nxt[N];
vector<pair<pair<int,int>,int> > f[2];
vector<pair<int,int> > ins[N];
int dp[N][3];

int get(int x,int y) {
	return x*m-m+y;
}

int solve() {
	for(int i=1;i<=m;i++) if(a[i] && b[i]) return -1;
	for(int i=1;i<=n;i++) {
		bool flag=0;
		for(int j=1;j<=m;j++) flag|=!b[get(i,j)];
		if(!flag) return -1;
	}
	for(int i=1;i<=m;i++) {
		s[i]=0;
		for(int j=1;j<=n;j++) s[i]+=b[get(j,i)];
	}
	int now=0;
	f[0].clear();
	for(int i=1;i<=m;i++) f[0].push_back({{i,i},s[i]});
	for(int i=n;i>=1;i--) {
		f[now^1].clear();
		pre[0]=0,nxt[m+1]=m+1;
		sum[0]=0;
		for(int j=1;j<=m;j++) {
			if(!b[get(i,j)]) pre[j]=j;
			else pre[j]=pre[j-1];
			sum[j]=sum[j-1]+s[j];
		}
		for(int j=m;j>=1;j--) {
			if(!b[get(i,j)]) nxt[j]=j;
			else nxt[j]=nxt[j+1];
		}
		for(auto j:f[now]) {
			int l=j.first.first,r=j.first.second,v=j.second;
			if(pre[r]>=l) f[now^1].push_back(j);
			else {
				if(pre[l]) f[now^1].push_back({{pre[l],r},v+sum[l-1]-sum[pre[l]-1]});
				if(nxt[r]<=m) f[now^1].push_back({{l,nxt[r]},v+sum[nxt[r]]-sum[r]});
			}
		}
		now^=1;
		f[now^1].clear();
		sort(f[now].begin(),f[now].end());
		for(int j=0;j<f[now].size();j++) {
			if(j && f[now][j].first==f[now][j-1].first) continue;
			f[now^1].push_back(f[now][j]);
		}
		now^=1;
		for(int j=1;j<=m;j++) s[j]-=b[get(i,j)];
	}
	for(int i=0;i<=m;i++) ins[i].clear();
	a[m+1]=0;
	for(auto i:f[now]) ins[i.first.second].push_back({i.first.first,i.second});
	dp[0][0]=0,dp[0][1]=dp[0][2]=1e9;
	for(int i=1;i<=m+1;i++) {
		for(int j=0;j<3;j++) {
			dp[i][j]=dp[i-1][j];
			if(j==1) dp[i][1]=min(dp[i][1],dp[i-1][0]);
			if(j) dp[i][j]+=b[i];
		}
		dp[i][0]=min(dp[i][0],dp[i-1][2]);
		for(auto j:ins[i-1]) {
			dp[i][2]=min(dp[i][2],min(dp[j.first-1][0],dp[j.first-1][1])+j.second+b[i]);
			dp[i][0]=min(dp[i][0],min(dp[j.first-1][0],dp[j.first-1][1])+j.second);
		}
		if(a[i]) dp[i][0]=1e9;
	}
	return dp[m+1][0];
}

int main() {
	T=read();
	while(T--) {
		m=read(),n=read();
		for(int i=1;i<=m;i++) a[i]=read();
		for(int i=1;i<=n*m;i++) b[i]=read();
		print(solve());put('\n');
	}
	return 0;
}