Untitled

#include 
#include
#include
#include
#include
using namespace std;
vector < pair > g[10005];
bool visited[10005];
int main()
{
    int t1,t2;
    cin>>t1>>t2;
    int k,n;
    cin>>k>>n;
    
    for(int i=0;i>a>>b>>c;
        g[a].push_back(make_pair(b,c));
        g[b].push_back(make_pair(a,c));
    }
    queue  q;
    q.push(t1);
    q.push(0);
   
    for(int i=0;i<=k;i++)
    {
        visited[i]=false;
    }
    while(!q.empty())
    {
        long long node=q.front();
        q.pop();
        long long dis=q.front();
        q.pop();
        if(node==t2)
        {
            cout<