#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

const int maxn = 100 + 10;
const int inf = 1000000 + 10;

struct Edge
{
    int to;
    int cost;
    
    Edge(int t, int c)
        :to(t), cost(c) {}
};

int lev[maxn];
vector<Edge> G[maxn];
int d[maxn];
bool vis[maxn];

void spfa(int n, int start, int end)
{
    queue<int> que;
    fill(d, d + n + 1, inf);
    memset(vis + 1, false, n);
    d[0] = 0;
    que.push(0);
    vis[0] = true;
    
    while (!que.empty()) {
        int v = que.front();
        que.pop();
        vis[v] = false;
        for (int u = 0; u < G[v].size(); u++) {
            Edge e = G[v][u];
            if (lev[e.to] >= start && lev[e.to] <= end) {
                if (d[v] + e.cost < d[e.to]) {
                    d[e.to] = d[v] + e.cost;
                    if (!vis[e.to]) {
                        que.push(e.to);
                        vis[e.to] = true;
                    }
                }
            }
        }
    }
}

int main()
{
    int m, n;
    scanf("%d%d", &m, &n);
    
    for (int i = 1; i <= n; i++) {
        int p, l, x;
        scanf("%d%d%d", &p, &l, &x);
        lev[i] = l;
        G[0].push_back(Edge(i, p));
        while (x--) {
            int t, v;
            scanf("%d%d", &t, &v);
            G[t].push_back(Edge(i, v));
        }
    }
    
    int ans = inf;
    for (int i = lev[1] - m; i <= lev[1]; i++) {
        spfa(n, i, i + m);
        ans = min(ans, d[1]);
    }
    printf("%d\n", ans);
    
    return 0;
}