#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cassert>
#include <bitset>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < (int) b; i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
#define f first
#define s second
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};
void setIO(string nome) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen ((nome + ".in").c_str(), "r", stdin);
freopen ((nome + ".out").c_str(), "w", stdout);
}
const int N = 1500 + 5;
const int M = 1500 + 5;
const int MOD = 1e9 + 7;
int n, m, k, streak [N];
int dp [N][M];
vvi g (N);
void add (int &a, int b) {
a += b;
while (a >= MOD) a -= MOD;
}
int solve (int node, int match) {
if (node == n - 1) return (match == k);
int &res = dp[node][match];
if (~res) return res;
res = 0;
int target = (match < k ? streak[match] : -1);
GO (to, g[node]) add (res, solve (to, match + (to == target)));
return res;
}
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
memset (dp, -1, sizeof(dp));
F0R (i, k) {
cin >> streak[i];
--streak[i];
}
F0R (i, m) {
int st, et;
cin >> st >> et;
--st; --et;
g[st].eb(et);
}
cout << solve (0, streak[0] == 0 ? 1 : 0) << '\n';
return 0;
}
