#include<iostream>
#include<cmath>
using namespace std;
int l[103];
int w[103][103];
int x;
int dist[103];
bool v[103];
int within[103];
int m,n;
void init(){
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++)
if(j==i)
w[i][j]=0;
else w[i][j]=0xffff;}}
int dijskal(){
int i,j;
memset(v,0,sizeof(v));
for(i=0;i<=n;i++){dist[i]=w[0][i];}
v[0]=1;
for(i=1;i<=n;i++){
int k,m=0xffff;
for(j=1;j<=n;j++)
if(!v[j]&&dist[j]<=m&&within[j]){
m=dist[j];
k=j;}
v[k]=1;
for(j=1;j<=n;j++)
if(!v[j]&&dist[j]>dist[k]+w[k][j]&&within[j])
dist[j]=dist[k]+w[k][j];}
return dist[1];
}
int main(){
scanf("%d%d",&m,&n);
init();
int i,j;
for(i=1;i<=n;i++){
scanf("%d%d%d",&w[0][i],&l[i],&x);
int a;
for(j=1;j<=x;j++){
scanf("%d",&a);
scanf("%d",&w[a][i]);}
}
int temp=0,min=0xffff;within[0]=1;
for(i=0;i<=m;i++){
memset(within,0,sizeof(within));
for(j=1;j<=n;j++)
if(l[j]-l[1]-i>=-m&&l[j]-l[1]<=i)
within[j]=1;
temp=dijskal();
if(temp<min)
min=temp;
}
//cout<<dist[1]<<endl;
cout<<min<<endl;
system("pause");
return 0;}