#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
struct ACAM{
	map <int, int> son,w;
	int fail,siz;
}t[N * 3];
int tot = 0,pt[N],n,m,k,eu[N],ev[N],ew[N],seq[N],len = 0,ban[N * 3];
map <pair <int,int> , int> path;
struct Segment_Tree{
	int cnt = 0,root[N * 3],lc[N * 30],rc[N * 30],siz[N * 30],w[N * 30],num[N * 30];
	inline void pushup(int pos) {siz[pos] = siz[lc[pos]] + siz[rc[pos]];}
	inline void copy(int x,int y)
	{
		lc[x] = lc[y]; rc[x] = rc[y]; siz[x] = siz[y]; w[x] = w[y]; 
	}
	inline int modify(int l,int r,int x,int k,int p,int pos)
	{
		int cur = ++cnt;
		copy(cur,pos);
		if(l == r) {siz[cur] = 1; w[cur] = k; num[cur] = p; return cur;}
		int mid = (l + r) >> 1;
		if(x <= mid) lc[cur] = modify(l,mid,x,k,p,lc[pos]);
		else rc[cur] = modify(mid + 1,r,x,k,p,rc[pos]);
		pushup(cur);
		return cur;
	}
	inline int query_num(int l,int r,int x,int pos)
	{
		if(!pos) return 0;
		if(l == r) return num[pos];
		int mid = (l + r) >> 1,ret = 0;
		if(x <= mid) ret = query_num(l,mid,x,lc[pos]);
		else ret = query_num(mid + 1,r,x,rc[pos]);
		return ret;
	} 
	inline pair <int,int> findmini(int l,int r,int pos)
	{
		if(l == r) {siz[pos]--; return make_pair(num[pos],w[pos]);}
		int mid = (l + r) >> 1; pair <int,int> ret = make_pair(0,0);
		if(siz[lc[pos]] > 0) ret = findmini(l,mid,lc[pos]);
		else ret = findmini(mid + 1,r,rc[pos]);
		pushup(pos);
		return ret; 
	} 
}tr;
inline void build()
{
	static int vis[N];
	memset(vis,0,sizeof(vis));
	queue <int> q;
	for(int i = 1;i <= n;i++) 
		if(t[0].son.find(i) != t[0].son.end())
		{
			tr.root[0] = tr.modify(1,n,i,0,t[0].son[i],tr.root[0]);
			q.push(t[0].son[i]),t[t[0].son[i]].fail = 0;
		}
	while(!q.empty())
	{
		int x = q.front(); q.pop();
		if(vis[x]) continue;
		vis[x] = 1;
		if(t[x].fail != 0)
			tr.copy(tr.root[x],tr.root[t[x].fail]);
		for(map <int,int> :: iterator it = t[x].son.begin(),id = t[x].w.begin();it != t[x].son.end();it++,id++) 
		{
			tr.root[x] = tr.modify(1,n,(*it).first,(*id).second,(*it).second,tr.root[x]);
			t[(*it).second].fail = tr.query_num(1,n,(*it).first,tr.root[t[x].fail]);
			q.push((*it).second);
		}
	}
}
typedef long long ll;
inline ll dijkstra()
{
	static int vis[N];
	static ll dis[N];
	ll ret = 0x3f3f3f3f3f3f3f3f;
	memset(dis,0x3f,sizeof(dis)); memset(vis,0,sizeof(vis));
	dis[1] = 0;
	priority_queue < pair<int,int> , vector< pair<int,int> > , greater< pair<int,int> > > q;
	q.push(make_pair(0,1));
	while(!q.empty())
	{
		int x = q.top().second; q.pop();
		if(vis[x] || ban[x] == 1) continue;
		if(ban[x] == 2) ret = min(ret,dis[x]);
		while(tr.siz[tr.root[x]])
		{
			pair <int,int> now = tr.findmini(1,n,tr.root[x]);
			if(dis[now.first] > dis[x] + now.second)
			{
				dis[now.first] = dis[x] + now.second;
				q.push(make_pair(dis[now.first],now.first));
			}
		}
	}
	return (ret == 0x3f3f3f3f3f3f3f3f ? -1 : ret);
}
int main()
{
	cin>>n>>m>>k;
	for(int i = 1;i <= m;i++)
		cin>>eu[i]>>ev[i]>>ew[i],path[make_pair(eu[i],ev[i])] = ew[i];
	for(int i = 1;i <= k;i++)
	{
		cin>>len;
		for(int j = 1;j <= len;j++) cin>>seq[j];
		int flag = 1;
		for(int j = 1;j <= len - 1;j++)
			if(path.find(make_pair(seq[j],seq[j + 1])) == path.end())
				flag = 0;
		if(!flag) continue;
		int np = 0;
		for(int j = 1;j <= len;j++)
		{
			if(t[np].son.find(seq[j]) == t[np].son.end())
			{
				t[np].son[seq[j]] = ++tot;
				if(j > 1) t[np].w[seq[j]] = path[make_pair(seq[j - 1],seq[j])];
				else t[np].w[seq[j]] = 0;
			}
			np = t[np].son[seq[j]];
			if(seq[j] == n) ban[np] = 2;
		}
		ban[np] = 1;
	}
	for(int i = 1;i <= n;i++) 
	{
		if(t[0].son.find(i) == t[0].son.end())
			t[0].son[i] = ++tot,t[0].w[i] = 0;
		pt[i] = t[0].son[i];
	}
	ban[pt[n]] = 2;
	for(int i = 1,np;i <= m;i++)
	{
		np = t[0].son[eu[i]];
		if(t[np].son.find(ev[i]) != t[np].son.end()) continue;
		t[np].son[ev[i]] = pt[ev[i]];
		t[np].w[ev[i]] = ew[i];
	}
	for(int i = 1;i <= tot;i++) if(!tr.root[i]) tr.root[i] = ++tr.cnt;
	build();
	cout<<dijkstra();
	return 0;
}