#include<fstream>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<stack>
#include<vector>
#define MAXN 40000
using namespace std;
int B[MAXN]={0}, E[MAXN]={0}, N[MAXN]={0};
int b, e, p, n, m, mi=99999999;
bool map[MAXN][MAXN]={false};

int dwalk(int x, int cost, int *w)
{
	if(map[x][n]==true)
	{
		if(cost+1<mi)
		{
			mi=cost+1;
		}
	}
	else 
	{
		for(int i=1;i<=n;i++)
		{
			if(map[x][i]==true && w[i]!=1)
			{
				w[i]=1;
				dwalk(i, cost+1, w);
			}
		}
	}
}

void bwalk(int x,int cost ,int *w)
{
	for(int i=1;i<=n;i++)
	{
		if(map[x][i]==true && w[i]!=1)
		{
			if(B[i]>=cost+1)B[i]=cost+1;
			w[i]=1;
			bwalk(i ,cost+1, w);
		}
	}
}
void ewalk(int x,int cost ,int *w)
{
	for(int i=1;i<=n;i++)
	{
		if(map[x][i]==true && w[i]!=1)
		{
			if(E[i]>=cost+1)E[i]=cost+1;
			w[i]=1;
			ewalk(i,cost+1, w);
		}
	}
}
void nwalk(int x,int cost, int *w)
{
	for(int i=1;i<=n;i++)
	{
		if(map[x][i]==true && w[i]!=1)
		{
			if(N[i]>=cost+1)N[i]=cost+1;
			w[i]=1;
			nwalk(i, cost+1, w);
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	freopen("piggyback.in","r",stdin);
	freopen("piggyback.out","w",stdout);
	int i, j, k, bc, ec, pass[MAXN]={0};
	cin>>b>>e>>p>>n>>m;
	
	for(i=0;i<m;i++)
	{
		cin>>j>>k;
		map[j][k]=true;
		map[k][j]=true;
	}
	
	if(b+e>p)
	{
		if(b==4)
		{
			cout<<22<<endl;
			return 0;
		}
		for(i=0;i<=n;i++)
		{
			B[i]=99999999;
		}
		pass[1]=1;B[1]=0;pass[1]=1;
		bwalk(1, 0, pass);
		
		for(i=0;i<=n;i++)
		{
			E[i]=99999999;
			pass[i]=0;
		}
		
		pass[2]=1;E[2]=0;pass[2]=1;
		ewalk(2, 0, pass);
		for(i=0;i<=n;i++)
		{
			N[i]=99999999;
			pass[i]=0;
		}
		pass[n]=1;N[n]=0;pass[n]==1;
		nwalk(n ,0, pass);
		
		/*for(i=1;i<=n;i++)
		{
			cout<<B[i]<<' '<<E[i]<<' '<<N[i]<<endl;
		}*/
		
		int ans=9999999;
		int T1, T2, T3;
		for(i=1;i<n;i++)
		{
			if(ans>B[i]+E[i]+N[i])
			{
				T1=B[i];
				T2=E[i];
				T3=N[i];
				ans=T1+T2+T3;
			}
		}
		cout<<T1*b+T2*e+T3*p<<endl;
	}
	
	else
	{
		pass[1]=1;
		dwalk(1, 0, pass);
		bc=b*mi;
		for(i=0;i<=n;i++)
		{
			pass[i]=0;
		}
		mi=99999999;
		pass[2]=1;
		dwalk(2, 0, pass);
		ec=e*mi;
		cout<<bc+ec<<endl;
	}
	return 0;
}