#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int INF=0x7fffffff/2;
const int SIZEN=1010;
int N=1000;
int c[SIZEN][SIZEN];
queue<int> Q;
bool inq[SIZEN];
void SPFA(int s,int f[]){
	memset(inq,0,sizeof(inq));
	while(!Q.empty()) Q.pop();
	for(int i=1;i<=N;i++) f[i]=INF;
	f[s]=0;inq[s]=true;Q.push(s);
	while(!Q.empty()){
		int x=Q.front();Q.pop();inq[x]=false;
		for(int u=1;u<=N;u++){
			if(c[x][u]==INF) continue;
			if(f[x]+c[x][u]<f[u]){
				f[u]=f[x]+c[x][u];
				if(!inq[u]){
					inq[u]=true;
					Q.push(u);
				}
			}
		}
	}
}
int A,B,M;
int lis[SIZEN];
int f[SIZEN];
void read(void){
	scanf("%d%d%d",&A,&B,&M);
	int cost,n;
	for(int i=1;i<=N;i++) for(int j=1;j<=N;j++) c[i][j]=INF;
	for(int i=1;i<=M;i++){
		scanf("%d%d",&cost,&n);
		//cout<<cost<<" "<<n<<endl;
		for(int j=1;j<=n;j++){
			scanf("%d",&lis[j]);
		}
		for(int j=1;j<=n;j++){
			for(int k=j+1;k<=n;k++){
				//cout<<lis[j]<<" "<<lis[k]<<endl;
				c[lis[j]][lis[k]]=min(c[lis[j]][lis[k]],cost);
			}
		}
		//cout<<endl;
	}
}
int main(){
	freopen("cowrouteb.in","r",stdin);
	freopen("cowrouteb.out","w",stdout);
	read();
	SPFA(A,f);
	if(f[B]>=INF) printf("-1\n");
	else printf("%d\n",f[B]);
	return 0;
}