#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int myrand() { return abs((int)mt()); }
const int maxn = 1e7 + 5;
long long fen[maxn];
void upd(int p, long long val) {
  p++;
  for (; p > 0; p -= p & -p) {
    chkmax(fen[p], val);
  }
}
long long query(int p) {
  p++;
  long long res = -LINF;
  for (; p < maxn; p += p & -p) {
    chkmax(res, fen[p]);
  }
  return res;
}
int fen2[maxn];
void upd2(int p, int val) {
  p++;
  for (; p > 0; p -= p & -p) {
    chkmax(fen2[p], val);
  }
}
int query2(int p) {
  p++;
  int res = -INF;
  for (; p < maxn; p += p & -p) {
    chkmax(res, fen2[p]);
  }
  return res;
}
void chemthan() {
  int n, m, q;
  cin >> n >> m;
  vector<int> k(n);
  vector<vector<int> > a(n), b(n);
  for (int i = (0); i < (n); ++i) {
    cin >> k[i];
    a[i].resize(k[i]);
    b[i].resize(k[i]);
    for (int& x : a[i]) cin >> x;
    for (int& x : b[i]) cin >> x;
  }
  cin >> q;
  vector<int> x(m);
  vector<long long> y(m);
  int ptr = 0;
  while (q--) {
    int u, v;
    cin >> u >> v;
    u--;
    for (int i = (0); i < (k[u]); ++i) {
      x[ptr] = a[u][i];
      y[ptr] = (long long)b[u][i] * v;
      ptr++;
    }
  }
  assert(ptr == m);
  vector<int> l(m), r(m);
  for (int i = (0); i < (m); ++i) l[i] = r[i] = i;
  fill_n(fen2, maxn, -INF);
  upd2(0, 0);
  for (int i = (1); i < (m); ++i) {
    int t = max(0, i - x[i] + 1);
    int w = query2(t);
    if (-INF < w) {
      l[i] = -w;
    }
    upd2(i, -l[i]);
  }
  fill_n(fen2, maxn, -INF);
  upd2(0, m - 1);
  for (int i = (m - 1) - 1; i >= (0); --i) {
    int t = min(m - 1, i + x[i] - 1);
    int w = query2(m - t - 1);
    if (-INF < w) {
      r[i] = w;
    }
    upd2(m - i - 1, r[i]);
  }
  fill_n(fen, maxn, -LINF);
  vector<long long> dp(m + 1, LINF);
  dp[m] = 0;
  for (int i = (m)-1; i >= (0); --i) {
    dp[i] = -query(m - i - 1);
    chkmin(dp[i], y[i] + dp[r[i] + 1]);
    upd(m - l[i] - 1, -(dp[i + 1] + y[i]));
  }
  cout << dp[0] << "\n";
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
