#include<bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;
typedef pair<int,int> pii;


const int maxn=50+125000+10;

struct edge{
    int u,v,flow;
    int cost;
};
vector<edge>e;
vector<int>vect[maxn];

void add_edge(int u,int v,int cost){

    vect[u].pb(e.size());
    e.pb({u,v,0,cost});

    vect[v].pb(e.size());
    e.pb({v,u,1,-cost});

    ///printf("%d %d %lld edge\n",u,v,cost);

}


int source,sink;
int pot[maxn],d[maxn];
int p[maxn],n,pos[maxn];

int send_flow(int &hasflow){

    priority_queue<pair<int,int> >st;
    for(int i=source;i<=sink;i++)d[i]=2e9;
    memset(p,-1,sizeof(p));
    memset(pos,0,sizeof(pos));

    st.push({0,source});
    d[source]=0;

    while(st.size()){

        int x=st.top().ss;
        st.pop();
        if(pos[x])continue;
        pos[x]=1;

        for(int i=0;i<vect[x].size();i++){

            int id=vect[x][i];
            int w=pot[e[id].u]+e[id].cost-pot[e[id].v];
            if(e[id].flow)continue;

            if(d[e[id].u]+w<d[e[id].v]){
                d[e[id].v]=d[e[id].u]+w;
                p[e[id].v]=id;
                st.push({-d[e[id].v],e[id].v});
            }

        }

    }

    if(p[sink]==-1){
        hasflow=0;
        return 0;
    }
    hasflow=1;

    for(int i=source;i<=sink;i++){
        pot[i]=d[i]-pot[source]+pot[i];
    }

    int curr=sink;

    int ret=0;
    while(curr!=source){

        int pid=p[curr];

        e[pid].flow^=1;
        e[pid^1].flow^=1;

        ret+=e[pid].cost;

        curr=e[pid].u;

    }

    return ret;

}

int go(){

    int ret=0;
    for(int i=1;i<=n;i++){

        ///printf("FSA  %d\n",i);

        int hasflow=0;
        int pom=send_flow(hasflow);

        if(!hasflow)return 1;

        ret+=pom;
    }
    return ret;
}
vector<int>cand;
vector<pair<pii,int> >cedge;
int main(){

    freopen("clothes.in","r",stdin);
    freopen("clothes.out","w",stdout);

    scanf("%d",&n);
    for(int i=1;i<=n;i++){

        int m;
        scanf("%d",&m);

        for(int j=1;j<=m;j++){

            int c,p;
            scanf("%d %d",&c,&p);

            cand.pb(c);
            cedge.pb({{i,c},p });
        }

    }

    ///sort(cand.begin(),cand.end());
    ///cand.resize( unique(cand.begin(),cand.end())-cand.begin() );
    /*for(int i=0;i<cedge.size();i++){
        int id=cedge[i].ff.ss;
        id=lower_bound(cand.begin(),cand.end(),id)-cand.begin();
        id++;
        cedge[i].ff.ss=id;
    }*/

    source=0;
    sink=n+cand.size()+1;
    int delta=n;
    for(int i=1;i<=n;i++)
        add_edge(source,i,0);
    for(int i=n+1;i<sink;i++)
        add_edge(i,sink,0);
    for(int i=0;i<cedge.size();i++){
        add_edge(cedge[i].ff.ff,cedge[i].ff.ss+delta,-cedge[i].ss);
        pot[cedge[i].ff.ss+delta]=min(pot[cedge[i].ff.ss+delta],-cedge[i].ss);
    }
    for(int i=n+1;i<sink;i++)
        pot[sink]=min(pot[sink],pot[i]);

    printf("-1\n");
    ///int ret=go();
    ///printf("%d\n",-ret);

return 0;
}