#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int INF=1e9;
bool flag1=0,flag2=0;
int n,m,i,p,zj1,zj2,zj3=0,ST,SD,ans;
struct www{
	int c;
	int s[501];
}A[510];
int fa[100000]={0};
bool cmp(const www&a,const www&b)
{
	return a.c<b.c;
}
inline int father(int x)
{
	if(x==fa[x])return x;
	return fa[x]=father(fa[x]);
}
int main()
{
	freopen("cowrouteb.in","r",stdin);
	freopen("cowrouteb.out","w",stdout);
	scanf("%d%d%d",&ST,&SD,&n);
	if(ST==SD)printf("0\n");
	else
	{
		ans=INF;
		for(i=1;i<=n;i++)
		{
			scanf("%d%d",&A[i].c,&A[i].s[0]);
			flag1=0,flag2=0;
			for(p=1;p<=A[i].s[0];p++)
			{
				scanf("%d",&A[i].s[p]);
				if(A[i].s[p]==ST)flag1=1;
				else if(A[i].s[p]==SD)
					if(flag1)flag2=1;
			}
			if(flag1&&flag2)
				if(ans>A[i].c)ans=A[i].c;
		}
		sort(A+1,A+(n+1),cmp);
		for(i=1;i<=100000;i++)fa[i]=i;
		for(i=1;i<=n;i++)
		{
			zj3+=A[i].c; 
			zj1=father(A[i].s[1]);
			for(p=2;p<=A[i].s[0];p++)
			{
				zj2=father(A[i].s[p]);
				if(zj2!=zj1)fa[zj2]=zj1;
			}
			zj1=father(ST);zj2=father(SD);
			if(zj1==zj2)
			{
				if(ans>zj3)ans=zj3;
				break;
			}
		}
		printf("%d\n",ans);
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}