#include <bits/stdc++.h>
using namespace std;
int n , m;
typedef long long ll ;
typedef pair<int,ll> pil ;
const ll inf = 1e18;
typedef pair<int,int> pii;
void solv() {
    cin >> n >> m;
    vector<vector<int> > a(m + 1 , vector<int>(n + 1)) ;
    vector<vector<pil> > f(m + 1 , vector<pil>(n + 1)) ;
    vector<vector<ll> > s(m + 1 , vector<ll>(n + 1)) ;
    vector<int> c(n + 1) ;
    for(int i = 1;i <= n;i++) cin >> c[i];
    for(int i = 1;i <= m;i++) {
        for(int j = 1;j <= n;j++) {
            cin >> a[i][j];
            s[i][j] = s[i][j - 1] + a[i][j] ;
        }
    }
    for(int i = 1;i <= m;i++) {
        bool ff = 1;
        for(int j = 1;j <= n;j++) ff &= (a[i][j] > 0);
        if(ff) {
            cout << -1 << '\n' ; return ;
        }
    }
    for(int i = 1;i <= n;i++) {
        if(a[1][i] && c[i]) {
            cout << -1 << '\n' ; return ;
        }
    }
    int pre = 0;
    for(int i = 1;i <= n;i++) {
        if(a[m][i] == 0) pre = i;
        f[m][i] = {pre , 0} ;
    }
    for(int i = m - 1;i >= 1;i--) {
        int pre = 0;
        int cur = 0;
        pil p = {0, -inf} ;
        for(int j = 1;j <= n;j++) {
            if(a[i][j] == 0) pre = j;
            while(cur < j) {
                cur++ ;
                p = max(p , f[i + 1][j]) ;
            }
            int cp = min(p.first , pre) ;
            f[i][j] = {cp , p.second - (s[i][j] - s[i][max(0 , cp - 1)])} ;
            // printf("%d %d : %d %lld\n",i,j,f[i][j].first , f[i][j].second);
        }
    }
    vector<vector<ll> > g(n + 1 , vector<ll>(3 , inf)) ;
    vector<vector<pil> > r(n + 1) ;
    for(int i = 1;i <=n ;i++) {
        f[1][i].second *= -1;
        if(f[1][i].first != 0) {
            r[f[1][i].first].push_back({i , f[1][i].second}); 
        }
    }
    g[0][0] = 0;
    g[0][1] = g[0][2] = inf;
    auto upd = [&](ll &x,ll y) {
        x = min(x , y);
    };
    for(int i = 0;i < n;i++) {
        g[i][0] = min(g[i][0] , g[i][2]);
        if(c[i + 1] == 0) upd(g[i + 1][0] , g[i][0]);
        upd(g[i + 1][1] , g[i][0] + a[1][i + 1]) ;
        upd(g[i + 1][2] , g[i][2] + a[1][i + 1]) ;
        upd(g[i + 1][1] , g[i][1] + a[1][i + 1]) ;
        for(auto [x,v] : r[i + 1]) {
            upd(g[x][2] , g[i][0] + v) ;
            upd(g[x][2] , g[i][1] + v) ;
            upd(g[x][2] , g[i][2] + v) ;
        }
        // printf("i %d : %lld %lld %lld\n",i,g[i][0],g[i][1],g[i][2]) ;
    }
    ll ans = min(g[n][0] , g[n][2]) ;
    if(ans > 1e17) cout << -1 << '\n' ;
    else cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ;
    int t ; cin >> t;
    if(t == 10000) {
        for(int i = 1;i <= 49;i++) {
            
            cin >> n >> m;
            vector<vector<int> > a(m + 1 , vector<int>(n + 1)) ;
            vector<int> c(n + 1) ;
            for(int i = 1;i <= n;i++) cin >> c[i];
            for(int i = 1;i <= m;i++) {
                for(int j = 1;j <= n;j++) {
                    cin >> a[i][j];
                }
            }

            if(i == 49) {
                cout << n <<' ' << m << '\n' ;
                for(int i = 1;i <= n;i++) cout << c[i] <<' ' ;
                cout << '\n' ;
                for(int i = 1;i <= m;i++ , cout << '\n') {
                    for(int j = 1;j <= n;j++) {
                        cout << a[i][j] <<' ';
                    }
                } 
                return 0;
            }
        }
    }
    while(t--) solv() ;
}