#include <bits/stdc++.h>
using namespace std; 
const int N = 5e3 + 5; 
const int M = 5e5 + 5; 

int n, m, q, u[M], v[M], tag[N]; 
int f[N][N], col[N], is[N], fa[2][N]; 
char a[N]; 
vector<int> E[N], G[N]; 

int find(int x, int i) {
    if (fa[i][x] == x) return x; 
    return fa[i][x] = find(fa[i][x], i); 
}

void dfs(int x, int c) {
    col[x] = c; 
    for (int y : E[x]) {
        if (!col[y]) dfs(y, -c); 
        else if (col[x] == col[y]) is[abs(c)] = 1; 
    }
}

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> m >> q >> a + 1; 
    queue<pair<int, int>> Q; 
    for (int i = 1; i <= n; ++i) a[i] -= '0', f[i][i] = 1, Q.emplace(i, i), fa[0][i] = fa[1][i] = i; 
    for (int i = 1; i <= m; ++i) {
        cin >> u[i] >> v[i]; 
        if (a[u[i]] == a[v[i]]) E[u[i]].emplace_back(v[i]), E[v[i]].emplace_back(u[i]); 
    }

    for (int i = 1; i <= n; ++i) if (!col[i]) dfs(i, i); 
    for (int i = 1; i <= m; ++i) {
        if (a[u[i]] != a[v[i]]) {
            int x = find(u[i], 0), y = find(v[i], 0); 
            if (x == y) continue; 
            G[u[i]].emplace_back(v[i]); G[v[i]].emplace_back(u[i]); 
            fa[0][x] = y; 
        } else {
            int x = find(u[i], 1), y = find(v[i], 1); 
            if (x == y) continue; 
            G[u[i]].emplace_back(v[i]); G[v[i]].emplace_back(u[i]); 
            fa[1][x] = y; 
            f[u[i]][v[i]] = f[v[i]][u[i]] = 1; 
            Q.emplace(u[i], v[i]); 
        }
    }

    for (int i = 1; i <= n; ++i) if (is[abs(col[i])]) G[i].emplace_back(i); 
    
    while (!Q.empty()) {
        auto [i, j] = Q.front(); Q.pop(); 
        for (int x : G[i]) for (int y : G[j]) if (a[x] == a[y] && !f[x][y]) {
            f[x][y] = f[y][x] = 1; 
            Q.emplace(x, y); 
        }
    }

    while (q--) {
        int x, y; cin >> x >> y; 
        cout << (f[x][y] ? "YES\n" : "NO\n"); 
    }
    return 0; 
}

/*
5 5 1
01000
1 2
2 3
3 4
4 5
3 3

1 5
*/