Targeted duplicate removal The task
In this challenge, you are given a number and a list.
Your task is to remove from the list all occurrences of the given number except the first (leftmost) one, and output the resulting list.
The other elements of the list should be left intact.

The number will be a positive integer below 1000, and the list will only contain positive integers below 1000.
The list is not guaranteed to contain any occurrences of the given number. It may even be empty. In these cases you should output the list as-is.
Input and output formats are flexible within reason. You can output by modifying the list in place.
The lowest byte count wins.

Test cases
5 [] -&gt; []
5 [5] -&gt; [5]
5 [5,5] -&gt; [5]
10 [5,5] -&gt; [5,5]
10 [5,5,10,10,5,5,10,10] -&gt; [5,5,10,5,5]
2 [1,2,3,1,2,3,1,2,3] -&gt; [1,2,3,1,3,1,3]
7 [9,8,7,6,5] -&gt; [9,8,7,6,5]
7 [7,7,7,7,7,7,7,3,7,7,7,7,7,7,3,7,1,7,3] -&gt; [7,3,3,1,3]
432 [432,567,100,432,100] -&gt; [432,567,100,100]
Husk, 5 4 bytes
üoEė

Try it online!

Saved 1 byte thanks to Razetime
Saved 2 bytes thanks to Jo King

Thanks to Razetime for suggesting ü and Jo King for letting me know I could leave the superscript arguments out, saving me 2 bytes. It removes duplicates with a custom predicate that makes sure both arguments are equal to the number to be removed.
Explanation:
üoEė
ü     Remove duplicates by binary function (implicit second argument)
 o    Compose 2 functions
   ė  Make a list of 3 elements (first element is implicitly added)
  E   Are they all equal?