#include<cstdio>
#include<vector>


using namespace std;


struct state_t
{
	int c, t;
};


struct road_t
{
	state_t s;
	int to;
};


struct city_t
{
	vector<road_t> road;
	vector<state_t> state;
};


vector<city_t> city;


int state_add(vector<state_t>& s, int c, int t)
{
	vector<int> remove;
	int r, is_add=1;

	for(int i=s.size()-1;i>=0;i--)
	{
		r=(c>=s[i].c)+(t<=s[i].t);
		if(r==2)
		{
			remove.push_back(i);
			is_add=1;
		}
		if(r==0)
		{
			is_add=0;
		}
	}

	for(unsigned i=0;i<remove.size();i++)
	{
		s.erase(s.begin()+remove[i]);
	}

	if(is_add) s.push_back((state_t){c, t});
	return is_add;
}


void solve(int x, int c, int t)
{
	if(state_add(city[x].state, c, t)==0) return;

	vector<road_t>& road=city[x].road;
	for(unsigned i=0;i<road.size();i++)
	{
		if(c-road[i].s.c<0) continue;
		solve(road[i].to, c-road[i].s.c, t+road[i].s.t);
	}
}


int main(void)
{
	int n, c, v;

	while(scanf("%d%d%d", &n, &c, &v)==3)
	{
		city.clear();
		city.resize(n+1);
		{
			vector<int> vs, vt, vy, vm;
			vs.resize(v);
			vt.resize(v);
			vy.resize(v);
			vm.resize(v);
			for(int i=0;i<v;i++) scanf("%d", &vs[i]);
			for(int i=0;i<v;i++) scanf("%d", &vt[i]);
			for(int i=0;i<v;i++) scanf("%d", &vy[i]);
			for(int i=0;i<v;i++) scanf("%d", &vm[i]);

			for(int i=0;i<v;i++)
			{
				city[vs[i]].road.push_back((road_t){{vy[i], vm[i]}, vt[i]});
			}
		}
		solve(1, c, 0);

		int t=-1;
		for(unsigned i=0;i<city[n].state.size();i++)
		{
			state_t& s=city[n].state[i];
			if(i==0 || t>s.t) t=s.t;
		}
		printf("%d\n", t);
	}

	return 0;
}