/**************************************************************

     Problem: 1565

     User: Tunix

     Language: C++

     Result: Accepted

     Time:2016 ms

     Memory:8000 kb

 ****************************************************************/

 //BZOJ 1565

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 inline int getint(){

     int v=,sign=; char ch=getchar();

     while(ch<''||ch>''){ if (ch=='-') sign=-; ch=getchar();}

     while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

     return v*sign;

 }

 const int N=,M=,INF=~0u>>;

 typedef long long LL;

 /******************tamplate*********************/

 int n,m,tot,ans,Sum,in[N],a[N];

 inline int pack(int i,int j){

     return (i-)*m+j;

 }

 struct edge{int to,v;};

 struct Net{

     edge E[M];

     int head[N],next[M],cnt;

     void ins(int x,int y,int v){

         E[++cnt]=(edge){y,v};

         next[cnt]=head[x]; head[x]=cnt;

     }

     void add(int x,int y,int v){

         ins(x,y,v); ins(y,x,);

     }

     vector<int>G[N];

     int S,T,cur[N],d[N],Q[N];

     bool mklevel(){

         F(i,S,T) d[i]=-;

         d[S]=;

         int l=,r=-;

         Q[++r]=S;

         while(l<=r){

             int x=Q[l++];

             for(int i=head[x];i;i=next[i])

                 if (d[E[i].to]==- && E[i].v){

                     d[E[i].to]=d[x]+;

                     Q[++r]=E[i].to;

                 }

         }

         return d[T]!=-;

     }

     int dfs(int x,int a){

         if (x==T) return a;

         int flow=;

         for(int &i=cur[x];i && flow<a;i=next[i])

             if (E[i].v && d[E[i].to]==d[x]+){

                 int f=dfs(E[i].to,min(a-flow,E[i].v));

                 E[i].v-=f;

                 E[i^].v+=f;

                 flow+=f;

             }

         if (!flow) d[x]=-;

         return flow;

     }

     void Dinic(){

         while(mklevel()){

             F(i,S,T) cur[i]=head[i];

             ans+=dfs(S,INF);

         }

     }

     void top_sort(){

         int l=,r=-;

         F(i,,tot) if(in[i]==){

             Q[++r]=i;

             if (a[i]>) {add(S,i,a[i]); Sum+=a[i];}

             else add(i,T,-a[i]);

         }

         while(l<=r){

             int x=Q[l++];

             rep(i,G[x].size()){

                 int y=G[x][i];

                 add(y,x,INF);

                 in[y]--;

                 if (in[y]==){

                     if (a[y]>){ add(S,y,a[y]); Sum+=a[y];}

                     else add(y,T,-a[y]);

                     Q[++r]=y;

                 }

             }

         }

     }

     void init(){

         n=getint(); m=getint(); cnt=;

         tot=n*m; S=; T=tot+; Sum=ans=;

         int x,y,p;

         F(i,,n) F(j,,m){

             a[pack(i,j)]=getint();

             p=getint();

             F(k,,p){

                 x=getint()+; y=getint()+;

                 G[pack(i,j)].pb(pack(x,y));

                 in[pack(x,y)]++;

             }

             if (j>){

                 G[pack(i,j)].pb(pack(i,j-));

                 in[pack(i,j-)]++;

             }

         }

         top_sort();

         Dinic();

         printf("%d\n",Sum-ans);

     }

 }G1;

 int main(){

 #ifndef ONLINE_JUDGE

     freopen("1565.in","r",stdin);

     freopen("1565.out","w",stdout);

 #endif

     G1.init();

     return ;

 }