DFS Traversal in graph

I am trying to do dfs traversal using recursive call, My Graph, and vector<int>visited are global variables. num_v variable corresponds to number of vertices,num_e corresponds to number of edges I tried calling two DFS calls in main, but my output matches to the correct DFS order for the first case. and it gives incorrect out for the other, kindly help where I'm getting wrong in the implementation of it.

sample input: first line is a number of vertices and number of edges. next, each line is directed nodes between two-point.

5 5
1 2
2 4
4 5
5 3
1 3

expected output:

1 2 4 5 3
2 4 5 3

my wrong output

1 2 4 5 3
2

code:

#include<iostream>
#include<vector>
#include<stack>
using namespace std;
int mx=1e5;
//int num_v;
vector<vector<int>>Graph(mx);
vector<int>visited;
void dfs(int v,vector<int>&vec){
    visited[v]=1;
    vec.push_back(v);
    for(int neigh:Graph[v]){
        if(visited[neigh]!=1){
            dfs(neigh,vec);
        }
    }
}
int main(){
    int num_v;int num_e;
    cin>>num_v>>num_e;
    visited.resize(num_v + 1);
    for(int i=0;i<num_e;i++){
        int u,v;
        cin>>u>>v;
        Graph[u].push_back(v);
    }
    vector<int>vec;
    dfs(1,vec);
    for(auto x:vec){
        cout<<x<<" ";
    }
    visited.clear();
    cout<<endl;
    vector<int>tt;
    dfs(2,tt);
    for(auto y:tt){
        cout<<y<<" ";
    }
}