#include <bits/stdc++.h>
using namespace std;
#define int long long
int gettime(string s){
	int cur = 0;
	for(int i = 0; i<s.size(); i++){
		if(s[i]=='d'){
			cur+=stoll(s.substr(0,i))*24*60;
		}
		if(s[i]==':'){
			cur+=stoll(s.substr(i-2,2))*60;
			cur+=stoll(s.substr(i+1));
		}
	}
	return cur*10;
}
const int mxn = 4000005;
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int m;
	cin >> m;
	int n = 0;
	map<string,int>hm;
	vector<vector<int>>arr(m,vector<int>(4));
	
	vector<int>used(mxn);
	for(int i = 0; i<m; i++){
		string a,b,c,d;
		cin >> a >> b >> c >> d;
		if(!hm.count(a)){
			n++;
			hm[a] = n;
		}
		arr[i][0] = hm[a];
		int t1 = gettime(b);
		arr[i][1] = t1;
		if(!hm.count(c)){
			n++;
			hm[c] = n;
		}
		arr[i][2] = hm[c];
		int t2 = gettime(d);
		arr[i][3] = t2;
		/*
		for(int j = 0; j<4; j++){
			cerr << arr[i][j] << ' ';
		}
		cerr << '\n';
		*/
	}
	vector<vector<int>>times(n+1);
	int q;
	cin >> q;
	vector<int>edges(q);
	for(int i = 0; i<q; i++){
		cin >> edges[i];
		edges[i]--;
		used[edges[i]] = 1;
	}
	//cerr << "gay\n";
	for(int i = 0; i<m; i++){
		times[arr[i][0]].push_back(arr[i][1]+ (1^used[i]));
		times[arr[i][2]].push_back(arr[i][3]);

	}
	vector<vector<pair<int,int>>>adj(mxn);
	int curnode = 0;
	map<pair<int,int>,int>mp;
	//cerr << "gay\n";
	for(int i = 1; i<=n; i++){
		set<int>s;
		for(int nxt: times[i]){
			s.insert(nxt);
		}
		times[i].clear();
		for(int nxt: s){
			times[i].push_back(nxt);
			curnode++;
			mp[{i,nxt}] = curnode;
		}
		for(int j = 1; j<times[i].size(); j++){
			int y = mp[{i,times[i][j]}];
			int x = mp[{i,times[i][j-1]}];
			int w = times[i][j]-times[i][j-1];
			adj[y].push_back({w,x});
		}
	}
	//cerr << "gay\n";
	vector<int>ends;
	for(int i = 0; i<m; i++){
		int x = mp[{arr[i][0],arr[i][1]+(1^used[i])}];
		int y = mp[{arr[i][2],arr[i][3]}];
		int w = arr[i][3] - arr[i][1];
		adj[y].push_back({w,x});
		if(arr[edges[q-1]][2] == arr[i][2]){
			ends.push_back(y);
		}
		/*
		for(int j = 0; j<4; j++){
			cerr << arr[i][j] << ' ';
		}
		cerr << '\n';
		*/
	}
	vector<int>dis(mxn,(int)1e18);
	vector<bool>vis(mxn);
	priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
	for(int nxt: ends){
		pq.push({0,nxt});
		dis[nxt] = 0;
	}
	//cerr << "gay\n";
	while(pq.size()){
		auto [d,cur] = pq.top(); pq.pop();
		if(vis[cur])continue;
		vis[cur] = true;
		for(pair<int,int>nxt: adj[cur]){
			if(dis[nxt.second] > nxt.first + d){
				dis[nxt.second] = nxt.first+d;
				pq.push({dis[nxt.second],nxt.second});
			}
		}
	}
	/*
	for(int i = 1; i<=n; i++){
		for(int nxt: times[i])cout << nxt << ' ';
			cout << '\n';
	}
	for(int i = 1; i<=30; i++){
		cout << dis[i] << ' ';
	}
	cout << '\n';
	*/
	int ans = 0;
	for(int i = 0; i<q; i++){
		int u = arr[edges[i]][0];
		int start = arr[edges[i]][1];
		if(u==arr[edges[q-1]][2])continue;
		auto it = upper_bound(times[u].begin(),times[u].end(),start);
		if(it == times[u].end()){
			ans = (int)1e18;
			//cout << "gay" << '\n';
			break;
		}
		int node = mp[{u,*it}];
		//cout << dis[node] + *it -  arr[edges[q-1]][3] << '\n';
		ans = max(ans,dis[node] + *it -  arr[edges[q-1]][3]);
	}
	if(ans > (int)1e15){
		cout << "stranded\n";
		return 0;
	}
	cout << ans/10 << '\n';
	return 0;
}