#include <bits/stdc++.h>
#define ll long long
#define int ll
#define vi vecotr<int>
#define rep(i,s,e) for(int i=(s); i<=(e); i++)
#define arr2 array<int,2>
#define arr3 array<int,3>
using namespace std;
const int LM=2020, mod=998244353;
int N,M,Q;
int P[LM], C[LM];
int D[4][LM], d[LM];
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>N>>M>>Q;
rep(i,1,N){
cin>>P[i];
}
C[1]|=1; C[2]|=2;
rep(i,1,M){
int u,v;cin>>u>>v;
if(u==1 || v==1){
C[u]|=1; C[v]|=1;
}
if(u==2 || v==2){
C[u]|=2; C[v]|=2;
}
}
D[1][0]=1;
D[2][0]=1;
D[3][0]=1;
rep(i,1,N){
if(!C[i]) continue;
fill(d,d+N+1,0);
rep(j,0,N){
d[j+1] = (d[j+1]+ D[C[i]][j]*P[i])%mod;
d[j] = (d[j] + D[C[i]][j]*(1-P[i]+mod))%mod;
}
rep(j,0,N) D[C[i]][j]=d[j];
}
while(Q--){
int x, y, ans=0;cin>>x>>y;
rep(i,0,min(x,y)){
ans = (ans + D[3][i] * D[2][y-i] %mod * D[1][x-i]%mod ) %mod;
}
cout<<ans<<"\n";
}
}
