#include<bits/stdc++.h>
// #define int long long
#define f1(i, n) for(int i=1;i<=n;++i)
#define f0(i, n) for(int i=0;i<n;i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define NAME "DUONGSAT"
using namespace std;

const int MAXN = 1e5 + 5;
const int INF = 2e9;
const int abg = 1e3 + 5;
const int base = 256;

int n, m, k;
vector<int> g[5001];
int dist[5001][5001][2];


void bfs(int start) {
    for (int i = 1; i <= n; ++i) {
        dist[start][i][0] = INF;
        dist[start][i][1] = INF;
    }

    queue<pair<int, int>> pq;
    pq.push({start, 0});
    dist[start][start][0] = 0;
    while (!pq.empty()) {
        auto x = pq.front();
        int u = x.first;
        int mod = x.second;
        pq.pop();
        for (auto v : g[u]) {
            int next_mod = 1 - mod;
            if (dist[start][v][next_mod] == INF) {
                dist[start][v][next_mod] = dist[start][u][mod] + 1;
                pq.push({v, next_mod});
            }
        }
    }
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    if (fopen(NAME".INP", "r")) {
        freopen(NAME".INP", "r", stdin);
        freopen(NAME".OUT", "w", stdout);
    }

    cin >> n >> m >> k;
    for (int i = 1; i <= m; ++i) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    for (int i = 1; i <= n; ++i) {
        bfs(i);
    }

    for (int i = 1; i <= k; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        if (g[u].empty()) {
            cout << "NO" << endl;
            continue;
        }
        int wmod2 = w % 2;
        int d = dist[u][v][wmod2];
        if (d <= w) {
            cout << "YES" << endl;
        }
        else cout << "NO" << endl;
    }



    return 0;
}