#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
const int N=610,INF=2147000000;
int n,m,a[N],h[N],hr[N],tot;
int dfn[N],low[N],tmcnt,is[N],st[N],top,ins[N],vis[N];
int S,T,dis[N],cur[N];
int sum;
queue<int> q;
vector<int> list[N];
struct Edge{int v,f,next;}g[1000010];
inline int min(int x,int y){return x<y?x:y;}
inline int id(int x,int y){return (x-1)*m+y;}
inline void addEdge(int u,int v){g[++tot].v=v; g[tot].next=h[u]; h[u]=tot;g[++tot].v=u; g[tot].next=hr[v]; hr[v]=tot;
}
inline void addEdge(int u,int v,int f){g[++tot].v=v; g[tot].f=f; g[tot].next=h[u]; h[u]=tot;g[++tot].v=u; g[tot].f=0; g[tot].next=h[v]; h[v]=tot;
}
bool bfs(){while(!q.empty()) q.pop();q.push(S);for(int i=1;i<=T;i++) dis[i]=-1;dis[S]=0;while(!q.empty()){int u=q.front(); q.pop();for(int i=h[u],v;i;i=g[i].next)if(g[i].f&&dis[v=g[i].v]==-1){dis[v]=dis[u]+1;if(v==T) return true;q.push(v);}}return dis[T]!=-1;
}
int dfs(int u,int delta){if(u==T) return delta;int ret=0,get;for(int i=cur[u],v;i&&delta;i=g[i].next)if(g[i].f&&dis[v=g[i].v]==dis[u]+1){get=dfs(v,min(delta,g[i].f));g[i].f-=get; g[i^1].f+=get;if(g[i].f) cur[u]=i;delta-=get; ret+=get;}if(!ret) dis[u]=-1;return ret;
}
int dinic(){int ret=0;while(bfs()){for(int i=1;i<=T;i++) cur[i]=h[i];ret+=dfs(S,INF);}return ret;
}
void tarjan(int u,int fa){dfn[u]=low[u]=++tmcnt;st[++top]=u; ins[u]=1;for(int i=h[u],v;i;i=g[i].next){v=g[i].v;if(!dfn[v]){tarjan(v,u);low[u]=min(low[u],low[v]);}else if(ins[v])low[u]=min(low[u],dfn[v]);}if(low[u]==dfn[u]){if(st[top]==u){ins[u]=0;top--;return;}int x;do{x=st[top--];ins[x]=0;is[x]=1;}while(x!=u);}
}
void clear(int u){vis[u]=1; is[u]=1;for(int i=hr[u],v;i;i=g[i].next)if(!vis[v=g[i].v])clear(v);
}
int main(){freopen("input.in","r",stdin);scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){int k=id(i,j),l,x,y;scanf("%d%d",&a[k],&l);while(l--){scanf("%d%d",&x,&y);addEdge(id(x+1,y+1),k);list[id(x+1,y+1)].push_back(k);}}for(int i=1;i<=n;i++)for(int j=1;j<m;j++)addEdge(id(i,j),id(i,j+1));for(int i=1,up=n*m;i<=up;i++) if(!dfn[i]) tarjan(i,0);for(int i=1,up=n*m;i<=up;i++)if(!vis[i]&&is[i])clear(i);for(int i=1,up=n*m;i<=up;i++) h[i]=0;tot=1;S=n*m+1; T=n*m+2;for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){int x=id(i,j);if(j<m&&!is[x]&&!is[id(i,j+1)])addEdge(x,id(i,j+1),INF);if(is[x]) continue;if(a[x]>=0){addEdge(S,x,a[x]);sum+=a[x];}else addEdge(x,T,-a[x]);int sz=list[x].size();for(int k=0;k<sz;k++)addEdge(x,list[x][k],INF);}int maxflow=dinic();    printf("%d\n",sum-maxflow);return 0;
}