RE求调

#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int>PII;
const int inf=0x3f3f3f3f;
const int N=1e6+10;
struct edge{int v,s;};
vector<edge>e[N];
int dis[N];
void solve()
{
	int n,m,q;
	cin>>n>>m>>q;
	for(int i=1;i<=m;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
        e[a].push_back({b,c});
        e[b].push_back({a,c});
	}
	auto dijkstra=[&](int x,int y)->int
	{
	   vector<int>dis(N,inf);dis[x]=0;
       vector<int>vis(N,false);
       priority_queue<PII>q;
       q.push({0,x});
       while(q.size())
       {
           auto t=q.top();q.pop();
           int u=t.second;
           if(vis[u])continue;
           vis[u]=true;
           for(auto y:e[u])
           {
           	  int v=y.v,s=y.s;
           	  if(dis[s]>dis[u]^s)
           	  {
           	  	dis[v]=dis[u]^s;
           	  	q.push({-dis[v],v});
           	  }
           }
       }
       return dis[y];
	};
	while(q--)
	{
		int x,y;
		cin>>x>>y;
		cout<<dijkstra(x,y)<<'\n';
	}
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	solve();
	return 0;
}