#include <bits/stdc++.h>

using namespace std;

constexpr int N = 3007;

int n, m;
int g[N][N];
int dist[N];
bool st[N];
int fa[N];
vector<int> g2[N];
void dijkstra(int Start) {
    memset(dist, 0x3f, sizeof(dist));
    memset(st, false, sizeof(st));
    dist[Start] = 0;
    for (int i = 0; i < n - 1; i++) {
        int t = -1;
        for (int j = 1; j <= n; j++) {
            if (!st[j] && (t == -1 || dist[t] > dist[j]) && fa[i] == 0) t = j;
        }
        st[t] = true;
        for(auto it:g2[i]){
        	fa[it]--;
		}
        for (int j = 1; j <= n; j++) {
            dist[j] = min(dist[j], dist[t] + g[t][j]);
        }
    }
}

int main() {
    cin >> n >> m;
    memset(g, 0x3f, sizeof(g));
    for (int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        if(u == v) continue;
        g[u][v] = min(g[u][v], w);
    }
    
    for(int i = 1;i<=n;i++){
    	cin >> fa[i];
    	for(int j = 1;j<=fa[i];j++){
    		int l;
    		cin >> l;
    		g2[l].push_back(i);
		}
	}

    dijkstra(1);

    cout << dist[n] << "\n";
    return 0;
}