#include<cstdio>
#include<algorithm>
#define INF 99999999
using namespace std;
int main(){
	freopen("cowrouteb.in","r",stdin);
	freopen("cowrouteb.out","w",stdout);
	int A,B,N;
	int C[510]={0};
	int d1[10010],d2[10010];
	for(int i=1;i<=10000;i++){d1[i]=INF;d2[i]=INF;}
	bool ye=false;
	scanf("%d%d%d",&A,&B,&N);
	for(int i=1;i<=N;i++){
		int a,b;
		scanf("%d%d",&a,&b);
		ye=false;
		for(int j=1;j<=b;j++){
			scanf("%d",&C[j]);
			if(C[j]==A)ye=true;
			if(ye==true)
				d1[C[j]]=min(a,d1[C[j]]);
			if(C[j]==B){
				for(int k=j;k>=1;k--){
					d2[C[k]]=min(a,d2[C[k]]);
				}
			}
		}
	}
	d1[A]=0;d2[B]=0;
	int ans=INF;
	for(int i=1;i<=10000;i++){
		ans=min(ans,d1[i]+d2[i]);
	}
	if(ans!=INF)printf("%d",ans);
	else printf("-1");
	return 0;
}