#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const int MXN = 200005;
const int MXV = MXN * 2;
const int MXD = MXN * 20;
const ll INF = 1e18;
int N, M, K, ndsz(1), lstp[MXN], V;
vector<pair<int, int>> to[MXN];
map<int, int> tto[MXN];
bool beend[MXN];
int fail[MXN], que[MXN], qh, qt;
int srt[MXN], sson[MXD][2], sval[MXD], ssz(1); // segment tree
ll dis[MXV], ans(INF);

int read() {
  int x(0), c(getchar());
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + (c - '0'), c = getchar();
  return x;
}
void write(long long x) {
  static char buf[30];
  if (!x) {
    putchar('0');
    return;
  }
  int d(0);
  while (x) buf[d++] = x % 10 + '0', x /= 10;
  while (d) putchar(buf[--d]);
}

inline int copynode(int p) {
  int q(ssz++);
  sson[q][0] = sson[p][0], sson[q][1] = sson[p][1];
  sval[q] = sval[p];
  return q;
}

void insert(int &p, int l, int r, int k, int v) {
  p = copynode(p);
  if (r - l == 1) {
    sval[p] = v;
    return;
  }
  int m((l + r) >> 1);
  if (k < m) insert(sson[p][0], l, m, k, v);
  else insert(sson[p][1], m, r, k, v);
}
int query(int p, int l, int r, int k) {
  if (!p || r - l == 1) return sval[p];
  int m((l + r) >> 1);
  if (k < m) return query(sson[p][0], l, m, k);
  return query(sson[p][1], m, r, k);
}

int main() {
  freopen("path.in", "r", stdin);
  freopen("path.out", "w", stdout);
  // input
  N = read(), M = read(), K = read();
  for (int u(0), v(0), w(0); M--;) {
    u = read() - 1, v = read() - 1, w = read();
    to[u].push_back(make_pair(v, w));
  }
  lstp[0] = -1;
  for (int plen(0); K--;) {
    plen = read();
    int p(0);
    for (int n(0); plen--;) {
      n = read() - 1;
      if (tto[p].find(n) == tto[p].end())
        lstp[ndsz] = n, tto[p][n] = ndsz++;
//    cout << p << '-' << n << '-';
      p = tto[p][n];
//    cout << p << endl;
    }
    beend[p] = true;
  }
  // build aho-corasick automaton
  fail[0] = -1;
  for (auto i : tto[0])
    insert(srt[0], 0, N, i.first, i.second),
    que[qt++] = i.second;
  while (qh != qt) {
    int c(que[qh++]);
//  cout << c << ':' << fail[c] << endl;
    srt[c] = srt[fail[c]];
    for (auto i : tto[c]) {
      insert(srt[c], 0, N, i.first, i.second);
      fail[i.second] = query(srt[fail[c]], 0, N, i.first);
      que[qt++] = i.second;
    }
  }
  // find shortest path
  // format (p on automaton, q on the graph) ->
  // q if p == 0; otherwise p + n - 1.
  V = N + ndsz - 1;
  fill(dis, dis + V, INF);
  int bg(query(srt[0], 0, N, 0));
  if (bg) bg += N - 1;
  dis[bg] = 0;
  priority_queue<pair<ll, int>> pq;
  pq.push(make_pair(0, bg));
  while (!pq.empty()) {
    ll d(-pq.top().first);
    int c(pq.top().second);
    pq.pop();
    if (d != dis[c]) continue;
    int p(0), q(0);
    if (c >= N) p = c - (N - 1), q = lstp[p];
    else p = 0, q = c;
//  cout << c << ' ' << p << ' ' << q << ' ' << d << endl;
    if (beend[p]) continue;
    if (q == N - 1) ans = min(ans, d);
    for (auto e : to[q]) {
      int n(e.first);
      int np(query(srt[p], 0, N, n));
      if (!np) np = n;
      else np += N - 1;
      ll nd(d + e.second);
      if (nd < dis[np])
//      cout << c << "->" << np << ':' << nd << endl,
        dis[np] = nd, pq.push(make_pair(-nd, np));
    }
  }
  printf("%lld\n", ans == INF ? -1 : ans);
  return 0;
}