#include<iostream>
#include<vector>
#define int long long
#define endl "\n"
using namespace std;
const int N=1e5+5;
struct st{
	int v,w;
};
vector<st> edge[N];
int a[N],p[N];
bool vis[N];
void insert(int x){
	for(int i=30;i>=0;i--){
		if(!(x>>i))continue;
		if(!p[i]){
			p[i]=x;
			break;
		}
		x^=p[i];
	}
}
void dfs(int u,int sum){
	a[u]=sum;vis[u]=true;
	for(int i=0;i<edge[u].size();i++){
		int v=edge[u][i].v,w=edge[u][i].w;
		if(!vis[v])dfs(v,sum^w);
		else insert(sum^a[v]^w);
	}
}
int query(int x){
	for(int i=30;i>=0;i--)x=max(x,x^p[i]);
	return x;
}
signed main(){
	cin.tie(0);cout.tie(0);
	ios::sync_with_stdio(false);
	int n,m,q;
	cin>>n>>m>>q;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		edge[u].push_back({v,w});
		edge[v].push_back({u,w});
	}
	dfs(1,0);
	int maxx=query(0);
	for(int i=1;i<=n;i++)a[i]^=a[i-1];
	while(q--){
		int l,r;
		cin>>l>>r;
		int x=r-l,ans=0;
		if(x&1)ans^=query(a[r]^a[l-1]);
		if((x*(x+1)/2)&1)ans^=maxx;
		cout<<ans<<endl;
	}
}