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

#ifndef ONLINE_JUDGE
#include "algo/debug.h"
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
const int INF = 1e9;
void solve() {
	int g;
	cin >> g;
	vector<string> s(g);
	for (auto &x : s) {
		cin >> x;
	}

	vector<vector<int>> dis(g, vector<int>(g, 0));

	for (int i = 0; i < g; i++) {
		for (int j = 0; j < g; j++) {
			int c = 0;
			for (int k = 0; k < s[i].size(); k++) {
				if (s[i][k] != s[j][k]) {
					c++;
				}
			}
			dis[i][j] = c;
		}
	}

	int t;
	cin >> t;
	if (t == 0) {
		cout << "\n";
	}
	while (t--) {
		int n, m;
		cin >> n >> m;
		if (n == 0) {
			cout << 0 << '\n';
			return;
		}
		vector<vector<int>> v(n);
		for (int i = 0, x; i + 1 < n; i++) {
			cin >> x;
			x--;
			v[i + 1].push_back(x);
			v[x].push_back(i + 1);
		}

		vector<vector<int>> dp(n, vector<int>(g, INF));
		// dp[node][id] -> assign s[id] to node and find the min weight in the subtree of node.

		vector<int> giv(n, 0);
		for (int j = 0, l, id; j < m; j++) {
			cin >> l >> id;
			id--; l--;

			giv[l] = 1;
			dp[l][id] = 0;
		}

		function<void(int, int)> dfs = [&](int node, int p) {
			for (auto ch : v[node]) {
				if (ch ^ p) {
					dfs(ch, node);
				}
			}
			if (!giv[node]) {
				for (int i = 0; i < g; i++) {
					int s = 0;
					for (auto ch : v[node]) {
						if (ch ^ p) {
							int mn = INF;
							for (int j = 0; j < g; j++) {
								mn = min(mn, dp[ch][j] + dis[i][j]);
							}
							s += mn;
						}
					}
					dp[node][i] = s;
				}
			}
		};

		dfs(0, -1);

		cout << *min_element(dp[0].begin(), dp[0].end()) << '\n';
	}
}

signed main() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#else
#endif
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int t = 1;
	//cin >> t;

	while (t--) {
		solve();
	}

	// cerr << "Time elapsed: " << ((long double)clock() / CLOCKS_PER_SEC) << " s.\n";
}