#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

// 2のべき乗数かどうか
bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};  // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};    // 右，下，左，上
const std::vector<int>
        dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

class Graph {
public:
    const int N;
    std::vector<std::vector<int>> graph;
    Graph(int N) : N(N) {
        this->graph.resize(N);
    }

    void add_undirected_edge(const int u, const int v) {
        this->graph.at(u).emplace_back(v);
        this->graph.at(v).emplace_back(u);
    }

    void add_directed_edge(const int from, const int to) {
        this->graph.at(from).emplace_back(to);
    }
};

class Edge {
public:
    int no = 0;
    int from = 0;
    int to = 0;
    int weight = 0;

    Edge(int no, int from, int to, long long weight) : no(no), from(from), to(to), weight(weight) {
    }

};

class WeightedGraph {
public:
    const int N;
    std::vector<std::vector<Edge>> graph;
    WeightedGraph(int N) : N(N) {
        this->graph.resize(N);
    }

    void add_undirected_edge(int no, const int u, const int v, const int w) {
        this->graph.at(u).emplace_back(Edge(no, u, v, w));
        this->graph.at(v).emplace_back(Edge(no, v, u, w));
    }
};

/**
 * startからすべての頂点への最小距離を求める O(|E| log |V|)
 * 負辺はないものとする
 */
std::vector<long long> dijkstra(int start, const WeightedGraph &graph) {
    const unsigned int num_node = graph.N;

    //[(最短距離, node番号)]のque(距離が近い順にとりだす)
    std::priority_queue<std::pair<long long, int>, std::vector<std::pair<long long, int>>, std::greater<std::pair<long long, int>>> que;
    que.push({0, start});

    std::vector<int> prev(num_node, -1);                        // 経路復元用
    std::vector<long long> distance(num_node, LONG_LONG_MAX);   // startからの距離
    distance[start] = 0;

    while (not que.empty()) {
        int from;
        long long now_dist;
        std::tie(now_dist, from) = que.top();
        que.pop();

        if (distance.at(from) < now_dist) {
            continue;
        }
        for (const auto &e : graph.graph.at(from)) {
            auto to = e.to;
            auto dist = e.weight;
            auto new_dist = now_dist + dist;

            if (new_dist < distance.at(to)) {
                prev.at(to) = from;
                distance.at(to) = new_dist;
                que.push({new_dist, to});
            }
        }
    }

    return distance;
}

bool need_update(const int u, const vector<LL> &dist, const vector<LL> &change, const vector<unordered_set<int>> &g) {
    if (u == 0 or change[u] != -1) {
        return false;
    }
    LL mini = LINF;
    FOE(v, g[u]) {
        if (v != u) {
            chmin(mini, dist[v] + 1);
        }
    }

    return mini > dist[u];
}

void dfs(const LL u, vector<LL> &dist, vector<LL> &change, const int no, const vector<unordered_set<int>> &g) {
    FOE(v, g[u]) {
        if (need_update(v, dist, change, g)) {
            change[v] = no;
            dist[v]++;
            dfs(v, dist, change, no, g);
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL N, M, Q;
    cin >> N >> M >> Q;

    vector<unordered_set<int>> graph(N);
    WeightedGraph g(N);
    auto edges = make_v<pair<int, int>>(M);
    FOR(i, 0, M) {
        LL U, V;
        cin >> U >> V;
        U--; V--;
        g.add_undirected_edge(i, U, V, 1);
        edges[i] = make_pair(U, V);
        graph[U].insert(V);
        graph[V].insert(U);
    }
    auto distance = dijkstra(0, g);
    
    auto change = make_v<LL>(N);
    fill_v(change, -1);
    FOR(i, 0, Q) {
        LL R;
        cin >> R;
        R--;

        LL U, V;
        tie(U, V) = edges[R];
        graph[U].erase(V);
        graph[V].erase(U);

        if (distance[U] == distance[V]) {
            continue;
        }
        else if (distance[U] > distance[V]) {
            swap(U, V);
        }

        if (need_update(V, distance, change, graph)) {
            change[V] = i;
            distance[V]++;
            dfs(V, distance, change, i, graph);
        }
    }

    auto ans = make_v<LL>(Q);
    FOR(i, 0, N) {
        if (change[i] != -1) {
            ans[change[i]]++;
        }
    }

    print(ans[0]);
    FOR(i, 0, Q - 1) {
        ans[i + 1] += ans[i];
        print(ans[i + 1]);
    }

    return 0;
}




Measured memory_bytes: 44316