#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}
void phongbeo();
const int inf = 1e18;
const ll mod2 = 1e9+7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0)x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    ll a;
    int  b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo();
//   checktime
}
ib dp[100002];
vector<ib> v[100002];
int c[100002];
ib mer(ib a,ib b)
{
    if(a.a<b.a) return a;
    if(b.a<a.a) return b;
    return {a.a,max(a.b,b.b)};
}
void bfs()
{
    deque<int> p;
    p.pb(1);
    dp[1]= {0,n+1};
    for(int i=2; i<=n; i++)
        dp[i].a=inf,dp[i].b=n+1;
    while(!p.empty())
    {
        int x=p.front();
        p.pop_front();
        for(auto f:v[x])
            if(dp[f.a].a==inf)
            {
                dp[f.a].a=dp[x].a+1;
                dp[f.a].b=min(dp[x].b,c[f.b]);
                p.pb(f.a);
            }
            else
            {
                dp[f.a]=mer(dp[f.a], {dp[x].a+1,min(dp[x].b,f.b)});
            }
    }
memset(c,0,sizeof c);
    for(int i=2; i<=n; i++)
        c[dp[i].b]++;
}
void phongbeo()
{
    cin>>n>>m>>k;
    for(int i=1; i<=m; i++)
    {
        cin>>l>>r;
        v[l].pb({r,i});
        v[r].pb({l,i});
        c[i]=n+1;
    }
    for(int i=1; i<=k; i++)
    {
        cin>>l;
        c[l]=i;
    }
    bfs();
    for(int i=1; i<=k; i++)
        c[i]+=c[i-1],cout<<c[i],down
    }