#include<iostream>

#include<stdio.h>

#define MAXN 105

#define inf 10000000

using namespace std;

struct dest

{

    int next;

    int len;

};

struct node

{

    int money;

    int stat;

    int dest_num;

    dest coll[MAXN];

};

int give_ans(int rang_b,int rang_e);

void Dijkstra(int m,int s);

node man[MAXN];

int _m[MAXN][MAXN];

int dij[MAXN];

bool last[MAXN];

int n;

int main()

{

    //freopen("acm.acm","r",stdin);

    int m;

    int i;

    int j;

    int tem;

    int min;

    int rang_begin;

    int rang_end;

    cin>>m>>n;

    memset(last,false,sizeof(last));

    for(i = ; i < n; ++ i)

    {

        cin>>man[i].money;

        cin>>man[i].stat;

        cin>>man[i].dest_num;

        if(man[i].dest_num == )

            last[i] = true;

        for(j = ; j < man[i].dest_num; ++ j)

        {

            cin>>man[i].coll[j].next;

            -- man[i].coll[j].next;

            cin>>man[i].coll[j].len;

        }

    }

    min = inf;

    for(i = ; i <= m; ++ i)

    {

        rang_begin = man[].stat;

        rang_end = rang_begin;

        rang_begin -= (m - i);

        rang_end += i;

    //    cout<<rang_begin<<" "<<rang_end<<endl;

        tem = give_ans(rang_begin,rang_end);

    //    cout<<tem<<"  8888888888888888"<<endl;

        if(tem < min)

            min = tem;

        //cout<<min<<endl;

    }

    if(min != inf)

        cout<<min<<endl;

    else

        cout<<man[].money<<endl;

}

int give_ans(int rang_b,int rang_e)

{

    int i;

    int j;

    int _min;

    for(i = ; i < n; ++ i)

    {

        for(j = ; j < n; ++ j)

        {

            _m[i][j] = inf;

        }

    }

    for(i = ; i < n; ++ i)        ///////////////敏感地区

    {

        if(man[i].stat >= rang_b && man[i].stat <= rang_e)

        for(j = ; j < man[i].dest_num; ++ j)

        {

            if(man[man[i].coll[j].next].stat >= rang_b && man[man[i].coll[j].next].stat <= rang_e)

            {

                _m[i][man[i].coll[j].next] = man[i].coll[j].len;

            //    if(man[man[i].coll[j].next].dest_num == 0)

            //        _m[i][man[i].coll[j].next] += man[man[i].coll[j].next].money;

            }

        }

    }

//    cout<<"b    dij"<<endl;

//    for(i = 0; i < n; ++ i)

//    {

//        cout<<i<<" ";

//        for(j = 0; j < n; ++ j)

//        {

//            if(_m[i][j] != inf)

//                cout<<j<<" ";

//        }

//        cout<<endl;

//    }

    Dijkstra(n,);

//    cout<<"DIJ"<<endl;

    _min = inf;

    for(i = ; i < n; ++ i)

    {

        if(dij[i] != - && dij[i] < _min)

        {

            _min = dij[i];

        }

    }

    return _min;

}

void Dijkstra(int m,int s)

{

    int i;

    int j;

    int min;

    int * mark = new int[m];

    memset(mark,,m*sizeof(int));

    memset(dij,-,sizeof(dij));

    dij[s] = ;

    mark[s] = ;

    int x;

    int k;

    min = -;

    for(i = ; i < m; ++ i)

    {

        if(_m[s][i] != inf)

            dij[i] = _m[s][i];

    }

    for(k = ; k < m; k++)

    {

        min = -;

        for(j = ; j < m; j++)

        {

            if(mark[j] ==  && dij[j] > )

            {

                if(dij[j] < min || min < )

                {

                    min = dij[j];

                    x = j;

                }

            }

        }

        //cout<<"7777777777777"<<endl;

        if(min == -)

            break;

        mark[x] = ;

        for(i = ; i < m; ++ i)

        {

            if(mark[i] ==  && _m[x][i] != inf)

            {

                if(dij[i] <  || dij[x] + _m[x][i] < dij[i])

                {

                    dij[i] = dij[x] + _m[x][i];

                }

            }

        }

    }

    for(i = ; i < m; ++ i)

    {

        if(dij[i] != -)

        {

            dij[i] += man[i].money;

    //        cout<<dij[i]<<" ";

        }

    }

//    cout<<endl;

    delete []mark;

}